Efficient two-phase approaches for branch-and-bound style resource constrained scheduling

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

In high-level synthesis (HLS), the resource constrained scheduling (RCS) tries to explore a time-minimum schedule for low-level hardware implementations under specific resource constraints. To achieve such an optimal schedule quickly, branch-and-bound (B&B) approaches are widely investigated to prune the fruitless search space. However, due to the lack of approaches that can obtain a tight initial feasible schedule, RCS generally starts with an incompact search space, which is not time-efficient. This paper proposes an efficient two-phase approach, which can quickly shrink the search space using a smaller upper-bound for efficient B&B RCS search. The experimental results demonstrate that our approach can drastically reduce the overall RCS time.

Original languageEnglish
Title of host publicationProceedings - 27th International Conference on VLSI Design, VLSID 2014; Held Concurrently with 13th International Conference on Embedded Systems Design
Pages162-167
Number of pages6
DOIs
StatePublished - 2014
Event27th International Conference on VLSI Design, VLSID 2014 - Held Concurrently with 13th International Conference on Embedded Systems Design - Mumbai, India
Duration: 5 Jan 20149 Jan 2014

Publication series

NameProceedings of the IEEE International Conference on VLSI Design
ISSN (Print)1063-9667

Conference

Conference27th International Conference on VLSI Design, VLSID 2014 - Held Concurrently with 13th International Conference on Embedded Systems Design
Country/TerritoryIndia
CityMumbai
Period5/01/149/01/14

Keywords

  • Branch-and-Bound
  • High-Level Synthesis
  • Resource Constrained Scheduling

Fingerprint

Dive into the research topics of 'Efficient two-phase approaches for branch-and-bound style resource constrained scheduling'. Together they form a unique fingerprint.

Cite this