Cyclo-static multiprocessor scheduling for the optimal realization of shift-invariant flow graphs

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.