Title :
Disproving the perfect-rate property of data-flow graphs unfolded by the least common multiple of the number of loop register
Author :
Wolz, Frank ; Kolla, Reiner
Author_Institution :
Dept. of Comput. Eng., Univ. of Wuerzburg, Germany
fDate :
5/1/2003 12:00:00 AM
Abstract :
In their 1991 paper "Static Rate-Optimal Scheduling of Iterative Data-Flow Programs via Optimum Unfolding", Parhi and Messerschmidt stated a perfect-rate property on unfolded data-flow graphs (DFGs). This is disproven by a simple counter example.
Keywords :
data flow computing; data flow graphs; processor scheduling; iterative data-flow programs; least common multiple; loop registers; optimum unfolding; perfect-rate property; static rate-optimal scheduling; unfolded data-flow graphs; Counting circuits; Processor scheduling;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.2003.1197137
