Gladigau J, Haubelt C, Teich J (2009)
Publication Status: Published
Publication Type: Book chapter / Article in edited volumes
Publication year: 2009
Publisher: Springer
Edited Volumes: Languages for Embedded Systems and their Applications
Series: Lecture Notes in Electrical Engineering
Book Volume: 36
Pages Range: 183-199
ISBN: 9781402097133
DOI: 10.1007/978-1-4020-9714-0_12
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.
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: Download