Unfolding of Multirate Data-Flow Graph to Compute Iteration Bound

Abstract

Parhietal. find the iteration bound (IB) by considering the equivalent single-rate data-flow graph (SRDFG) N’ of N, which is generally an exponential time task and the transformed SRDFG is much larger (grows exponentially) than the MRDFG. Ito et al. proposed a novel algorithm to remove node/edge redundancies taking extra time and memory, but losing schedule information of removed nodes. We propose to reduce the MRDFG in a loop-wise fashion (reduce the nodes/edges in a loop as a whole) with fewer nodes/edges. The scheduling of nodes in the MRDFG can be derived from that of the reduced SRDFG., where one invocation of a node n corresponds to a consecutive number of invocations of n in the MRDFG.