Title :
Rate-optimal fully-static multiprocessor scheduling of data-flow signal processing programs
Author :
Parhi, Keshab K. ; Messerschmitt, David G.
Author_Institution :
Dept. of Electr. Eng., Minnesota Univ., Minneapolis, MN, USA
Abstract :
The authors introduce the notion of a perfect-rate data-flow program and show that these programs can always be executed in minimum time without requiring any unfolding or retiming operation at all. They show that unfolding any data-flow program beyond a certain factor does not lead to any further reduction in the execution time. This optimum unfolding factor is given by the least common multiple of the loop delay counts in the data-flow program graph. The authors show that unfolding with optimum unfolding factor reduces any iterative data-flow program to an equivalent perfect-rate data-flow program. They obtain upper bounds on the number of needed processors needed to achieve minimum-time schedules
Keywords :
parallel processing; performance evaluation; scheduling; data-flow signal processing programs; execution time; loop delay counts; minimum time; optimum unfolding factor; perfect-rate data-flow program; upper bounds; Concurrent computing; Data engineering; Delay; High performance computing; Iterative algorithms; Processor scheduling; Real time systems; Signal processing; Signal processing algorithms; Upper bound;
Conference_Titel :
Circuits and Systems, 1989., IEEE International Symposium on
Conference_Location :
Portland, OR
DOI :
10.1109/ISCAS.1989.100746
