@inproceedings{35aa5be1b1564230a0cf041035a52a6f,
title = "On Retiming Synchronous Data-Flow Graphs",
abstract = "Many common iterative or recursive DSP applications can be represented by synchronous data-flow graphs (SDFGs). A great deal of research has been done attempting to optimize such applications through retiming. However, despite its proven effectiveness in transforming single-rate data-flow graphs to equivalent DFGs with smaller clock periods, the use of retiming for attempting to reduce the execution time of synchronous DFGs has never been explored. This paper accomplishes exactly this. It develops the basic definitions and results necessary for expressing and studying SDFGs. The problems faced when attempting to retime a SDFG in order to minimize clock period are reviewed, then a retiming algorithm presented. Finally, the effectiveness of our method is demonstrated on an example.",
author = "O'Neil, \{Timothy W.\} and Sha, \{Edwin H.M.\}",
note = "Publisher Copyright: {\textcopyright} (2001) by the International Society for Computers and Their Applications All rights reserved.; 14th International Conference on Parallel and Distributed Computing Systems, PDCS 2001 ; Conference date: 08-08-2001 Through 10-08-2001",
year = "2001",
language = "英语",
series = "14th International Conference on Parallel and Distributed Computing Systems 2001, PDCS 2001",
publisher = "International Society for Computers and Their Applications (ISCA)",
pages = "103--108",
editor = "Edwin Sha",
booktitle = "14th International Conference on Parallel and Distributed Computing Systems 2001, PDCS 2001",
address = "美国",
}