Global scheduling with code-motions for high-level synthesisapplications

摘要

In this paper, we present a global scheduling technique fornsynthesis applications. The algorithm accepts a specification containingnconditional branches and while-loop constructs and schedules it for angiven set of resources. The algorithm performs several types of codenmotions across different basic blocks and trades off cost withnperformance. Several real-life examples taken from Numerical Recipes innC are used to demonstrate the efficacy of the approach. The resultsnindicate that code-motions are very important for achieving significantnspeed-ups for synthesis applications