Rate-optimal scheduling of recursive DSP algorithms based on the scheduling-range chart
- 1 September 1990
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
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 faiKeywords
This publication has 7 references indexed in Scilit:
- Cyclo-static multiprocessor scheduling for the optimal realization of shift-invariant flow graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Rate-optimal fully-static multiprocessor scheduling of data-flow signal processing programsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Force-directed scheduling for the behavioral synthesis of ASICsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1989
- Static Scheduling of Synchronous Data Flow Programs for Digital Signal ProcessingIEEE Transactions on Computers, 1987
- The maximum sampling rate of digital filters under hardware speed constraintsIEEE Transactions on Circuits and Systems, 1981
- Local Microcode Compaction TechniquesACM Computing Surveys, 1980
- Optimal Scheduling Strategies in a Multiprocessor SystemIEEE Transactions on Computers, 1972