Symbolic scheduling of SystemC dataflow designs

Beitrag in einem Sammelwerk


Details zur Publikation

Autorinnen und Autoren: Gladigau J, Haubelt C, Teich J
Herausgeber: M. Radetzki
Titel Sammelwerk: Languages for Embedded Systems and their Applications
Verlag: Springer
Jahr der Veröffentlichung: 2009
Titel der Reihe: Lecture Notes in Electrical Engineering
Band: 36
Seitenbereich: 183-199
ISBN: 9781402097133


Abstract


In this chapter, we propose a quasi-static scheduling (QSS) method applicable to SystemC dataflow designs. QSS determines a schedule where several static schedules are combined in a dynamic schedule. This, among others, reduces runtime overhead. QSS is done by performing as much static scheduling as possible at compile time, and only treating data-dependent control flow as runtime decision. Our approach improves known quasi-static approaches in a way that it is automatically applicable to real world designs, and has less restrictions on the underlying model. The effectiveness of the approach based on symbolic computation is demonstrated by scheduling a SystemC design of a network packet filter. © 2009 Springer Science+Business Media B.V.



FAU-Autorinnen und Autoren / FAU-Herausgeberinnen und Herausgeber

Gladigau, Jens Dr.-Ing.
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)


Zitierweisen

APA:
Gladigau, J., Haubelt, C., & Teich, J. (2009). Symbolic scheduling of SystemC dataflow designs. In M. Radetzki (Eds.), Languages for Embedded Systems and their Applications. (pp. 183-199). Springer.

MLA:
Gladigau, Jens, Christian Haubelt, and Jürgen Teich. "Symbolic scheduling of SystemC dataflow designs." Languages for Embedded Systems and their Applications. Ed. M. Radetzki, Springer, 2009. 183-199.

BibTeX: 

Zuletzt aktualisiert 2018-26-10 um 21:53