Retiming for synchronous data flow graphs

N. Liveris*, C. Lin, J. Wang, Hai Zhou, P. Banerjee

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Scopus citations

Abstract

In this paper we present a new algorithm for retiming Synchronous Dataflow (SDF) graphs. The retiming aims at minimizing the cycle length of an SDF. The algorithm is provably optimal and its execution time is improved compared to previous approaches.

Original languageEnglish (US)
Title of host publicationProceedings of the ASP-DAC 2007 - Asia and South Pacific Design Automation Conference 2007
Pages480-485
Number of pages6
DOIs
StatePublished - Dec 1 2007
EventASP-DAC 2007 - Asia and South Pacific Design Automation Conference 2007 - Yokohama, Japan
Duration: Jan 23 2007Jan 27 2007

Other

OtherASP-DAC 2007 - Asia and South Pacific Design Automation Conference 2007
CountryJapan
CityYokohama
Period1/23/071/27/07

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Retiming for synchronous data flow graphs'. Together they form a unique fingerprint.

  • Cite this

    Liveris, N., Lin, C., Wang, J., Zhou, H., & Banerjee, P. (2007). Retiming for synchronous data flow graphs. In Proceedings of the ASP-DAC 2007 - Asia and South Pacific Design Automation Conference 2007 (pp. 480-485). [4196078] https://doi.org/10.1109/ASPDAC.2007.358032