Analysis of systemc actor networks for efficient synthesis

Beitrag in einer Fachzeitschrift

Details zur Publikation

Autorinnen und Autoren: Falk J, Zebelein C, Keinert J, Haubelt C, Teich J, Bhattacharyya SS
Zeitschrift: ACM Transactions on Embedded Computing Systems
Verlag: Association for Computing Machinery (ACM)
Jahr der Veröffentlichung: 2010
Band: 10
Heftnummer: 2
ISSN: 1539-9087


Applications in the signal processing domain are often modeled by dataflow graphs. Due to heterogeneous complexity requirements, these graphs contain both dynamic and static dataflow actors. In previous work, we presented a generalized clustering approach for these heterogeneous dataflow graphs in the presence of unbounded buffers. This clustering approach allows the application of static scheduling methodologies for static parts of an application during embedded software generation for multiprocessor systems. It systematically exploits the predictability and efficiency of the static dataflow model to obtain latency and throughput improvements. In this article, we present a generalization of this clustering technique to dataflow graphs with bounded buffers, therefore enabling synthesis for embedded systems without dynamic memory allocation. Furthermore, a case study is given to demonstrate the performance benefits of the approach. © 2010 ACM.

FAU-Autorinnen und Autoren / FAU-Herausgeberinnen und Herausgeber

Falk, Joachim
Lehrstuhl für Informatik 12 (Hardware-Software-Co-Design)
Haubelt, Christian Prof. Dr.-Ing.
Technische Fakultät
Teich, Jürgen Prof. Dr.-Ing.
Lehrstuhl für Informatik 12 (Hardware-Software-Co-Design)

Einrichtungen weiterer Autorinnen und Autoren

University of Maryland


Falk, J., Zebelein, C., Keinert, J., Haubelt, C., Teich, J., & Bhattacharyya, S.S. (2010). Analysis of systemc actor networks for efficient synthesis. ACM Transactions on Embedded Computing Systems, 10(2).

Falk, Joachim, et al. "Analysis of systemc actor networks for efficient synthesis." ACM Transactions on Embedded Computing Systems 10.2 (2010).


Zuletzt aktualisiert 2018-26-10 um 14:50