Performance evaluation using data flow graphs for concurrent processing

The authors present a systematic procedure to find the exact iteration bound for an arbitrary nonterminating data flow graph (DFG). The complexity of the procedure to identify the critical loop and the iteration bound is O(n/sup 3/ log n), where n is the number of nodes in the DFG. Lookahead is anot... View More