• Publication
  • 2003
  • Issue No. 5 - May
  • Abstract - Disproving the Perfect-Rate Property of Data-Flow Graphs Unfolded by the Least Common Multiple of the Number of Loop Registers
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Disproving the Perfect-Rate Property of Data-Flow Graphs Unfolded by the Least Common Multiple of the Number of Loop Registers
May 2003 (vol. 52 no. 5)
pp. 688

Abstract—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.

[1] K.K. Parhi and D.G. Messerschmitt, "Static Rate-Optimal Scheduling of Iterative Data-Flow Programs Via Optimum Unfolding," IEEE Trans. Computers, vol. 40, no. 2, pp. 178-195, Feb. 1991.

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
Usage of this product signifies your acceptance of the Terms of Use.