By Topic

Iteration bounds of single-rate data flow graphs for concurrent processing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chao, D.Y. ; Dept. of Comput. & Inf. Sci., New Jersey Inst. of Technol., Newark, NJ, USA ; Wang, D.T.

Single-rate data flow graphs (DFGs) are often used for modeling iterative concurrent activities. A DFG and its iteration bound are equivalent to a marked graph and cycle time of a Petri net, respectively. Ramamoorthy and Ho [1980] developed an efficient algorithm for checking the minimum cycle time against a predetermined performance requirement. This work presents a systematic procedure to find the iteration bound and the critical loop with time complexity O(n3 log n) (n being the number of nodes), memory requirements of O(n 2), and subcritical loops with time complexity O(n3). The next-critical loops are also studied because they may become the new critical loop if the look-ahead technique is used. The above procedure has been implemented in the C programming language which interfaces with a Petri net X-window tool to display the performance results

Published in:

Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on  (Volume:40 ,  Issue: 9 )