• 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
ASCII Text
x 
 
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.
 
 
BibTex
x
 
@article{ 10.1109/TC.2003.1197137,
author = {Frank Wolz and Reiner Kolla},
title = {Disproving the Perfect-Rate Property of Data-Flow Graphs Unfolded by the Least Common Multiple of the Number of Loop Registers},
journal ={IEEE Transactions on Computers},
volume = {52},
number = {5},
issn = {0018-9340},
year = {2003},
pages = {688},
doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2003.1197137},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - Disproving the Perfect-Rate Property of Data-Flow Graphs Unfolded by the Least Common Multiple of the Number of Loop Registers
IS - 5
SN - 0018-9340
SP
EP
EPD - 688
A1 - Frank Wolz,
A1 - Reiner Kolla,
PY - 2003
KW - Data-flow graphs
KW - data-flow programs
KW - perfect-rate.
VL - 52
JA - IEEE Transactions on Computers
ER -
 

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.