Scheduling on Cyclo Static Data Flow Graphs

This Book main objective is to present different algorithms for showing how to schedule cyclo static data flow graphs(CSDFGs) which are used to represent digital signal processing applications and to optimize their schedules. We present an iteration bound equation for CSDFGs and equation for checking the liveness of a CSDFG which is a key factor for constructing a static schedule. Optimizing the schedule is also explained by designing rotation scheduling algorithm which continuously applies the down rotate operation on the given CSDFG for a constant number of times, which is determined experimentally.