Rate-optimal fully-static multiprocessor scheduling of data-flow signal processing programs

Keshab K Parhi, David G. Messerschmitt

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

The authors introduce the notion of a perfect-rate data-flow program and show that these programs can always be executed in minimum time without requiring any unfolding or retiming operation at all. They show that unfolding any data-flow program beyond a certain factor does not lead to any further reduction in the execution time. This optimum unfolding factor is given by the least common multiple of the loop delay counts in the data-flow program graph. The authors show that unfolding with optimum unfolding factor reduces any iterative data-flow program to an equivalent perfect-rate data-flow program. They obtain upper bounds on the number of needed processors needed to achieve minimum-time schedules.

Original languageEnglish (US)
Pages (from-to)1923-1928
Number of pages6
JournalProceedings - IEEE International Symposium on Circuits and Systems
Volume3
StatePublished - Dec 1 1989

Fingerprint

Signal processing
Scheduling

Cite this

Rate-optimal fully-static multiprocessor scheduling of data-flow signal processing programs. / Parhi, Keshab K; Messerschmitt, David G.

In: Proceedings - IEEE International Symposium on Circuits and Systems, Vol. 3, 01.12.1989, p. 1923-1928.

Research output: Contribution to journalArticle

@article{0120e64659ec4afda87abe3f521fa99a,
title = "Rate-optimal fully-static multiprocessor scheduling of data-flow signal processing programs",
abstract = "The authors introduce the notion of a perfect-rate data-flow program and show that these programs can always be executed in minimum time without requiring any unfolding or retiming operation at all. They show that unfolding any data-flow program beyond a certain factor does not lead to any further reduction in the execution time. This optimum unfolding factor is given by the least common multiple of the loop delay counts in the data-flow program graph. The authors show that unfolding with optimum unfolding factor reduces any iterative data-flow program to an equivalent perfect-rate data-flow program. They obtain upper bounds on the number of needed processors needed to achieve minimum-time schedules.",
author = "Parhi, {Keshab K} and Messerschmitt, {David G.}",
year = "1989",
month = "12",
day = "1",
language = "English (US)",
volume = "3",
pages = "1923--1928",
journal = "Proceedings - IEEE International Symposium on Circuits and Systems",
issn = "0271-4310",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Rate-optimal fully-static multiprocessor scheduling of data-flow signal processing programs

AU - Parhi, Keshab K

AU - Messerschmitt, David G.

PY - 1989/12/1

Y1 - 1989/12/1

N2 - The authors introduce the notion of a perfect-rate data-flow program and show that these programs can always be executed in minimum time without requiring any unfolding or retiming operation at all. They show that unfolding any data-flow program beyond a certain factor does not lead to any further reduction in the execution time. This optimum unfolding factor is given by the least common multiple of the loop delay counts in the data-flow program graph. The authors show that unfolding with optimum unfolding factor reduces any iterative data-flow program to an equivalent perfect-rate data-flow program. They obtain upper bounds on the number of needed processors needed to achieve minimum-time schedules.

AB - The authors introduce the notion of a perfect-rate data-flow program and show that these programs can always be executed in minimum time without requiring any unfolding or retiming operation at all. They show that unfolding any data-flow program beyond a certain factor does not lead to any further reduction in the execution time. This optimum unfolding factor is given by the least common multiple of the loop delay counts in the data-flow program graph. The authors show that unfolding with optimum unfolding factor reduces any iterative data-flow program to an equivalent perfect-rate data-flow program. They obtain upper bounds on the number of needed processors needed to achieve minimum-time schedules.

UR - http://www.scopus.com/inward/record.url?scp=0024946686&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024946686&partnerID=8YFLogxK

M3 - Article

VL - 3

SP - 1923

EP - 1928

JO - Proceedings - IEEE International Symposium on Circuits and Systems

JF - Proceedings - IEEE International Symposium on Circuits and Systems

SN - 0271-4310

ER -