Global Scheduling with Code-Motions for High-Level Synthesis Applications

Minjoong Rim, Yaw Fann, Rajiv Jain

Research output: Contribution to journalArticlepeer-review

29 Scopus citations

Abstract

In this paper, we present a global scheduling technique for synthesis applications. The algorithm accepts a specification containing conditional branches and while-loop constructs and schedules it for a given set of resources. The algorithm performs several types of code motions across different basic blocks and trades off cost with performance. Several real-life examples taken from Numerical Recipes in C are used to demonstrate the efficacy of the approach. The results indicate that code-motions are very important for achieving significant speed-ups for synthesis applications.

Original languageEnglish
Pages (from-to)379-392
Number of pages14
JournalIEEE Transactions on Very Large Scale Integration (VLSI) Systems
Volume3
Issue number3
DOIs
StatePublished - Sep 1995

Fingerprint

Dive into the research topics of 'Global Scheduling with Code-Motions for High-Level Synthesis Applications'. Together they form a unique fingerprint.

Cite this