Rate-optimal scheduling of recursive DSP algorithms based on the scheduling-range chart

Author

De Groot, Sonia M Heemstra ; Herrmann, Otto E.

Author_Institution

Fac. of Electr. Eng., Twente Univ., Enschede, Netherlands

fYear

1990

fDate

1-3 May 1990

Firstpage

1805

Abstract

A method for rate-optimal scheduling of recursive DSP algorithms is presented. The approach is based on the determination of the scheduling window of each operation and the construction of a scheduling-range chart. The information in the chart is used during scheduling to optimize some quality criteria (number of hardware resources, latency, register life time) at the same time that a rate-optimal solution is guaranteed. An algorithm based on this approach is introduced. It can schedule cyclic as well as acyclic data-flow graphs. The algorithm is powerful enough to solve optimally some problems for which other proposed methods fail

Keywords

computerised signal processing; parallel algorithms; scheduling; acyclic data-flow graphs; cyclic data-flow graphs; hardware resources; latency; quality criteria; rate-optimal scheduling; recursive DSP algorithms; register life time; scheduling window; scheduling-range chart; Delay; Digital signal processing; Flow graphs; Hardware; Laboratories; Network theory (graphs); Parallel processing; Processor scheduling; Sampling methods; Scheduling algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 1990., IEEE International Symposium on

Conference_Location

New Orleans, LA

Type

conf

DOI

10.1109/ISCAS.1990.111986

Filename

111986