An Algorithm for Resource Constrained Scheduling with Clock Selection

To expand the solution space that can be explored by data flow synthesis, and to obtain globally optimized scheduling results under resource constraints, an algorithm for resource constrained scheduling with clock selection is proposed.The single cycle operations, multi-cycle operations and chained operations can be constituted to calculate the candidate clock periods.When scheduling is under way, the proper clock period that can make the resource utilized adequately and the latency of data-path decreased will be selected.This process will be iterated until no available clock period can be chosen.At the end of the iteration, both scheduling and clock selection are accomplished.The impact of resource constraints can be introduced into clock selection, so the most optimized clock period can be obtained to improve scheduling results.And it is guaranteed that the scheduling results can be globally optimized by performing scheduling and clock selection simultaneously.Experimental results show that the latency of data-path can be effectively minimized by the proposed algorithm.