A rule-based static dataflow clustering algorithm for efficient embedded software synthesis

Falk J, Zebelein C, Haubelt C, Teich J (2011)


Publication Status: Published

Publication Type: Conference contribution, Conference Contribution

Publication year: 2011

Pages Range: 521-526

Article Number: 5763094

Conference Proceedings Title: Proceedings of Design, Automation and Test in Europe (DATE'11)

Event location: Grenoble FR

ISBN: 9783981080179

URI: https://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=79957549287&origin=inward

Abstract

In this paper, an efficient embedded software synthesis approach based on a generalized clustering algorithm for static dataflow subgraphs embedded in general dataflow graphs is proposed. The clustered subgraph is quasi-statically scheduled, thus improving performance of the synthesized software in terms of latency and throughput compared to a dynamically scheduled execution. The proposed clustering algorithm outperforms previous approaches by a faster computation and a more compact representation of the derived quasi-static schedules. This is achieved by a rule-based approach, which avoids an explicit enumeration of the state space. Experimental results show significant improvements in both performance and code size when compared to a state-of-the-art clustering algorithm. © 2011 EDAA.

Authors with CRIS profile

Related research project(s)

How to cite

APA:

Falk, J., Zebelein, C., Haubelt, C., & Teich, J. (2011). A rule-based static dataflow clustering algorithm for efficient embedded software synthesis. In Proceedings of Design, Automation and Test in Europe (DATE'11) (pp. 521-526). Grenoble, FR.

MLA:

Falk, Joachim, et al. "A rule-based static dataflow clustering algorithm for efficient embedded software synthesis." Proceedings of the 14th Design, Automation and Test in Europe Conference and Exhibition, DATE 2011, Grenoble 2011. 521-526.

BibTeX: Download