The Community for Technology Leaders
Green Image
ABSTRACT
<p><b>Abstract</b>—In the paper "Static Rate-Optimal Scheduling of Iterative Data-Flow Programs via Optimum Unfolding", the authors stated a perfect-rate property on unfolded data-flow graphs (DFGs). This will be disproven in the following by a simple counter example.</p>
INDEX TERMS
Data-flow graphs, data-flow programs, perfect-rate.
CITATION

R. Kolla and F. Wolz, "Disproving the Perfect-Rate Property of Data-Flow Graphs Unfolded by the Least Common Multiple of the Number of Loop Registers," in IEEE Transactions on Computers, vol. 52, no. , pp. 688, 2003.
doi:10.1109/TC.2003.1197137
86 ms
(Ver 3.3 (11022016))