Shop : Details
Shop
Details
Michael Beyer
Static Analysis of Run-time Modes in Kahn Process Networks
Kahn Process Networks (KPNs) are used for modeling streaming-oriented applications with changing behavior. To meet the performance and energy constraints of embedded devices, such applications must be mapped to parallel architectures in an optimal way. Finding an optimal mapping to the constrained architecture presumes that the behavior of the KPN is statically known. Considering the run-time behavior of streaming-oriented applications, we can identify run-time modes in which the system offers a certain behavior. In this book, we present a static analysis that identifies such run-time modes at compile-time.
To that end, we use abstract interpretation based on polyhedral abstraction and an automata-based representation of KPNs to consider the expected run-time behavior. We have developed a state partitioning algorithm to separate control-oriented parts from transformative parts. The automata states are partitioned according to the run-time behavior. We identify modes and their hierarchies for individual processes by using our graph reduction algorithm to transform state partitioned automata to mode automata. To obtain the overall network behavior, we have developed a composition algorithm for asynchronously communicating mode automata. We abstract from unnecessary considerations of interleaving states by choosing one representative execution. The result is a mode automaton describing the whole network behavior.
To evaluate our method, we have implemented a prototype of our analysis. For an arbitrary KPN, our implementation statically analyzes its run-time modes and their corresponding behaviors. We have evaluated typical case studies, e. g., a reconfigurable Finite Impulse Response filter, which demonstrate the practicability of our approach. Optimizing backends that map KPNs to parallel architectures can be guided by these analysis results.
To that end, we use abstract interpretation based on polyhedral abstraction and an automata-based representation of KPNs to consider the expected run-time behavior. We have developed a state partitioning algorithm to separate control-oriented parts from transformative parts. The automata states are partitioned according to the run-time behavior. We identify modes and their hierarchies for individual processes by using our graph reduction algorithm to transform state partitioned automata to mode automata. To obtain the overall network behavior, we have developed a composition algorithm for asynchronously communicating mode automata. We abstract from unnecessary considerations of interleaving states by choosing one representative execution. The result is a mode automaton describing the whole network behavior.
To evaluate our method, we have implemented a prototype of our analysis. For an arbitrary KPN, our implementation statically analyzes its run-time modes and their corresponding behaviors. We have evaluated typical case studies, e. g., a reconfigurable Finite Impulse Response filter, which demonstrate the practicability of our approach. Optimizing backends that map KPNs to parallel architectures can be guided by these analysis results.
Schlagwörter: static analysis; Kahn process networks; run-time behavior; modes; polyhedral abstraction
Verfügbare Online-Dokumente zu diesem Titel
DOI 10.2370/9783844012521
Sie benötigen den Adobe Reader, um diese Dateien ansehen zu können. Hier erhalten Sie eine kleine Hilfe und Informationen, zum Download der PDF-Dateien.
Bitte beachten Sie, dass die Online-Dokumente nicht ausdruckbar und nicht editierbar sind.
Bitte beachten Sie auch weitere Informationen unter: Hilfe und Informationen.
Bitte beachten Sie auch weitere Informationen unter: Hilfe und Informationen.
| Dokument |  | Abstract / Kurzzusammenfassung | ||
| Dateiart |  | |||
| Kosten |  | frei | ||
| Aktion |  | Anzeigen der Datei - 117 kB | ||
| Aktion |  | Download der Datei - 117 kB | ||
| Dokument |  | Gesamtdokument | ||
| Dateiart | | |||
| Kosten |  | 34,35 € | ||
| Aktion |  | Zahlungspflichtig kaufen und anzeigen der Datei - 1,1 MB | ||
| Aktion |  | Zahlungspflichtig kaufen und download der Datei - 1,1 MB | ||
| Dokument |  | Inhaltsverzeichnis | ||
| Dateiart | | |||
| Kosten | | frei | ||
| Aktion | | Anzeigen der Datei - 178 kB | ||
| Aktion | | Download der Datei - 178 kB | ||
Benutzereinstellungen für registrierte Online-Kunden (Online-Dokumente)
Sie können hier Ihre Adressdaten ändern sowie bereits georderte Dokumente erneut aufrufen.
Benutzer
Nicht angemeldet
Export bibliographischer Daten
Shaker Verlag GmbHAm Langen Graben 15a52353 Düren
Mo. - Do. 8:00 Uhr bis 16:00 UhrFr. 8:00 Uhr bis 15:00 Uhr
Kontaktieren Sie uns. Wir helfen Ihnen gerne weiter.
