Retiming for Synchronous Data Flow Graphs

2007 Asia and South Pacific Design Automation Conference Pub Date : 2007-01-23 DOI:10.1109/ASPDAC.2007.358032

N. Liveris, Chuan Lin, J. Wang, H. Zhou, P. Banerjee

引用次数: 10

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.

查看原文本刊更多论文

同步数据流程图的重新计时

本文提出了一种新的同步数据流(SDF)图重定时算法。重定时的目的是最小化SDF的周期长度。该算法具有可证明的最优性，与以往的算法相比，其执行时间得到了改善。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2007 Asia and South Pacific Design Automation Conference

自引率

0.00%

发文量