Static Rate-Optimal Scheduling of Multirate DSP Algorithms via Retiming and Unfolding

This paper presents an exact method and a heuristic method for static rate-optimal multiprocessor scheduling of real-time multirate DSP algorithms represented by synchronous data flow graphs (SDFGs). Through exploring the state-space generated by a self-timed execution (STE) of an SDFG, a static rate-optimal schedule via explicit retiming and implicit unfolding can be found by our exact method. By constraining the number of concurrent firings of actors of an STE, the number of processors used in a schedule can be limited. Using this, we present a heuristic method for processor-constrained rate-optimal scheduling of SDFGs. Both methods do not explicitly convert an SDFG to its equivalent homogenous SDFG. Our experimental results show that the exact method gives a significant improvement compared to the existing methods; our heuristic method further reduces the number of processors used.