Cyclo-static multiprocessor scheduling for the optimal realization of shift-invariant flow graphs
- 23 March 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 10, 1384-1387
- https://doi.org/10.1109/icassp.1985.1168234
Abstract
Cyclo-static processor solutions overcome the weaknesses of systolic processors and of SSIMD and PSSIMD solutions for the class of algorithms that can be described by cyclic shift-invariant flow graphs. Cyclo-static solutions are a broad family of processor (efficiency) optimal, synchronous, multiprocessor realizations that by appropriate design choices can be rate optimal, input-output delay optimal and communications optimal. For a given algorithm the cyclo-static family of solutions contains many classes which includes SSIMD and PSSIMD solutions as special cases, when they exist.Keywords
This publication has 2 references indexed in Scilit:
- A graph theoretic technique for the generation of systolic implementations for shift-invariant flow graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- The maximum sampling rate of digital filters under hardware speed constraintsIEEE Transactions on Circuits and Systems, 1981