Unfolding and retiming data-flow DSP programs for risc multiprocessor scheduling

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

13 Scopus citations

Abstract

Retiming and unfolding are two useful techniques which have been effectively applied in many fields. In this paper, we combine these two technique for the problem of rate-optimal scheduling for unit-Time DFG. A rutc-optimal retimable graph is a DFG such that after a legal retim-ing a rate-optimal schedule ran be obtained. For the case of unit-Time DFG, which is applicable to RISC multiprocessors, we improve the best known upper-bound for an unfolding factor which produces a rate-optimal retimable DFG, and we show that our result is (he minimum possible unfolding factor for rate-optimal schedules. Moreover, for any unfolding factor, the corresponding minimum rate is given by a simple criterion. Since we prove that the order of retiming and unfolding is irrelevant, efficient polynomial-Time retiming algorithms are obtained.

Original languageEnglish
Title of host publicationICASSP 1992 - 1992 International Conference on Acoustics, Speech, and Signal Processing
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages565-568
Number of pages4
ISBN (Electronic)0780305329
DOIs
StatePublished - 1992
Externally publishedYes
Event1992 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 1992 - San Francisco, United States
Duration: 23 Mar 199226 Mar 1992

Publication series

NameICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Volume5
ISSN (Print)1520-6149

Conference

Conference1992 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 1992
Country/TerritoryUnited States
CitySan Francisco
Period23/03/9226/03/92

Fingerprint

Dive into the research topics of 'Unfolding and retiming data-flow DSP programs for risc multiprocessor scheduling'. Together they form a unique fingerprint.

Cite this