Global scheduling for high-level synthesis applications

Yaw Fann, Minjoong Rim, Rajiv Jain

Research output: Contribution to journalConference articlepeer-review

4 Scopus citations

Abstract

In this paper, we present a resource-constrained global scheduling technique for synthesis applications. The algorithm accepts specifications containing conditional branches and while loops and schedules them 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 are used to demonstrate the efficacy of the approach.

Original languageEnglish
Pages (from-to)542-546
Number of pages5
JournalProceedings - Design Automation Conference
DOIs
StatePublished - 1994
EventProceedings of the 31st Design Automation Conference - San Diego, CA, USA
Duration: 6 Jun 199410 Jun 1994

Fingerprint

Dive into the research topics of 'Global scheduling for high-level synthesis applications'. Together they form a unique fingerprint.

Cite this