Global scheduling for high-level synthesis applications
Yaw Fann, Minjoong Rim, Rajiv Ratan Jain · 1994
In this paper, we present a resource-constrained global scheduling technique for synthesis applications. The algorithm accepts speci cations containing conditional branches and while loops and schedules them for a given set of resources. The algorithm performs several types of code motions across di erent basic blocks and trades o cost with performance. Several real-life examples are used to demonstrate the e cacy of the approach. 1