A Rule-Based Quasi-Static Scheduling Approach for Static Islands in Dynamic Dataflow Graphs

Beitrag in einem Sammelwerk


Details zur Publikation

Autorinnen und Autoren: Falk J, Zebelein C, Haubelt C, Teich J
Titel Sammelwerk: ACM Transactions on Embedded Computing Systems
Verlag: ACM
Verlagsort: New York, NY
Jahr der Veröffentlichung: 2013
Band: 12(3)
Seitenbereich: 74:1-74:31
ISSN: 1539-9087


Abstract

In this article, an efficient rule-based clustering algorithm for static dataflow subgraphs in a dynamic dataflow graph is presented. The clustered static dataflow actors are quasi-statically scheduled, in such a way that the global performance in terms of latency and throughput is improved compared to a dynamically scheduled execution, while avoiding the introduction of deadlocks as generated by naive static scheduling approaches. The presented clustering algorithm outperforms previously published approaches by a faster computation and more compact representation of the derived quasi-static schedule. This is achieved by a rulebased approach, which avoids an explicit enumeration of the state space. A formal proof of the correctness of the presented clustering approach is given. Experimental results show significant improvements in both, performance and code size, compared to a state-of-the-art clustering algorithm. © 2013 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)


Zitierweisen

APA:
Falk, J., Zebelein, C., Haubelt, C., & Teich, J. (2013). A Rule-Based Quasi-Static Scheduling Approach for Static Islands in Dynamic Dataflow Graphs. In ACM Transactions on Embedded Computing Systems. (pp. 74:1-74:31). New York, NY: ACM.

MLA:
Falk, Joachim, et al. "A Rule-Based Quasi-Static Scheduling Approach for Static Islands in Dynamic Dataflow Graphs." ACM Transactions on Embedded Computing Systems. New York, NY: ACM, 2013. 74:1-74:31.

BibTeX: 

Zuletzt aktualisiert 2019-04-06 um 17:53