PPS: a pipeline path-based scheduler

This paper presents a scheduling algorithm that improves on other approaches when dealing with the synthesis of control-flow dominated behavioral descriptions. It achieves this through the use of a constraint-driven path-based scheduling algorithm. The suboptimality of the original path-based algorithms when dealing with loops is overcome through a new technique for pipelining different loop iterations during execution path generation. Results show that the algorithm always generates the fastest solution in terms of clock cycles