Iteration Bounds of Single-Rate Data Flow Graphs for Concurrent Processing

Document Type

Article

Publication Date

1-1-1993

Abstract

Single-rate data flow graphs (DFGs) [1], [13] 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 [25] 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 [2], [15], [24], [26] and the critical loop with time complexity O(n3logn) (n being the number of nodes), memory requirements of O(n2), 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 [24] is used. The above procedure has been implemented in the C programming language which interfaces with our Petri net X-window tool to display the performance results. © 1993 IEEE

Identifier

0027668015 (Scopus)

Publication Title

IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications

External Full Text Location

https://doi.org/10.1109/81.244917

ISSN

10577122

First Page

629

Last Page

634

Issue

9

Volume

40

Grant

421190

This document is currently not available here.

Share

COinS