Title :
Retiming for Synchronous Data Flow Graphs
Author :
Liveris, N. ; Lin, C. ; Wang, J. ; Zhou, H. ; Banerjee, P.
Author_Institution :
Northwestern Univ., Evanston, IL
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.
Keywords :
data flow analysis; graph theory; cycle length; retiming; synchronous data flow graphs; Delay; Digital signal processing; Flow graphs; Minimization methods; Predictive models; Processor scheduling; Production; Runtime; Scheduling algorithm; Throughput;
Conference_Titel :
Design Automation Conference, 2007. ASP-DAC '07. Asia and South Pacific
Conference_Location :
Yokohama
Print_ISBN :
1-4244-0629-3
Electronic_ISBN :
1-4244-0630-7
DOI :
10.1109/ASPDAC.2007.358032
