The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (2003 vol.52)
pp: 688
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
Frank Wolz, Reiner Kolla, "Disproving the Perfect-Rate Property of Data-Flow Graphs Unfolded by the Least Common Multiple of the Number of Loop Registers", IEEE Transactions on Computers, vol.52, no. 5, pp. 688, May 2003, doi:10.1109/TC.2003.1197137
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool