Extended retiming: Optimal scheduling via a graph-theoretical approach

被引:3
作者
O'Neil, TW [1 ]
Tongsima, S [1 ]
Sha, EHM [1 ]
机构
[1] Univ Notre Dame, Dept Comp Sci & Engn, Notre Dame, IN 46556 USA
来源
ICASSP '99: 1999 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, PROCEEDINGS VOLS I-VI | 1999年
关键词
D O I
10.1109/ICASSP.1999.758320
中图分类号
O42 [声学];
学科分类号
070206 ; 082403 ;
摘要
Many iterative or recursive applications commonly found in DSP and image processing applications can be represented by data-flow graphs (DFGs). This graph is then used to perform DFG scheduling, where the starting times for executing the application's individual tasks are determined. The minimum length of time required to execute all tasks once is called the schedule length of the DFG. A great deal of research has been done attempting to optimize such applications by applying various graph transformation techniques to the DFG in order to minimize this schedule length. One of the most effective of these techniques is retiming. In this paper, we demonstrate that the traditional retiming technique does not always achieve optimal schedules and propose a new graph-transformation technique, extended retiming, which will. We will also present an algorithm for finding an extended retiming which transforms a DFG into one with minimal schedule length. Finally, we will demonstrate a constant-time algorithm which verifies the existence of a retimed DFG with the minimum schedule length.
引用
收藏
页码:2001 / 2004
页数:4
相关论文
共 8 条
[1]   Circuit retiming applied to decomposed software pipelining [J].
Calland, PY ;
Darte, A ;
Robert, Y .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1998, 9 (01) :24-35
[2]   Scheduling data-flow graphs via retiming and unfolding [J].
Chao, LF ;
Sha, EHM .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1997, 8 (12) :1259-1267
[3]   STATIC SCHEDULING FOR SYNTHESIS OF DSP ALGORITHMS ON VARIOUS MODELS [J].
CHAO, LF ;
SHA, EHM .
JOURNAL OF VLSI SIGNAL PROCESSING, 1995, 10 (03) :207-223
[4]  
Darte A., 1997, Parallel Processing Letters, V7, P379, DOI 10.1142/S0129626497000383
[5]  
LEISERSON CE, 1991, ALGORITHMICA, V6, P5, DOI 10.1007/BF01759032
[6]   THE MAXIMUM SAMPLING RATE OF DIGITAL-FILTERS UNDER HARDWARE SPEED CONSTRAINTS [J].
RENFORS, M ;
NEUVO, Y .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1981, 28 (03) :196-202
[7]   Resource-constrained loop list scheduler for DSP algorithms [J].
Wang, CY ;
Parhi, KK .
JOURNAL OF VLSI SIGNAL PROCESSING, 1995, 11 (1-2) :75-96
[8]  
ZAKY A, 1992, P INT C PAR PROC, P130