### Abstract

Rate-optimal scheduling of iterative data-flow graphs requires the computation of the iteration period bound. According to the formal definition, the total computational delay in each directed loop in the graph has to be calculated in order to determine that bound. As the number of loops cannot be expressed as a polynomial function of the number of modes in the graph, this definition cannot be the basis of an efficient algorithm. A polynomial-time algorithm for the computation of the iteration period bound based on longest path matrices and their multiplications is presented

Original language | Undefined |
---|---|

Pages (from-to) | 49-52 |

Number of pages | 4 |

Journal | IEEE transactions on circuits and systems I: fundamental theory and applications |

Volume | 0 |

Issue number | 1 |

DOIs | |

Publication status | Published - 1992 |

### Keywords

- IR-14661
- METIS-111725

## Cite this

Gerez, S. H., Heemstra de Groot, S. M., & Herrmann, O. E. (1992). A Polynomial-Time Algorithm for the Computation of the Iteration-Period Bound in Recursive Data-Flow Graphs.

*IEEE transactions on circuits and systems I: fundamental theory and applications*,*0*(1), 49-52. https://doi.org/10.1109/81.109243