An efficient ILP-based scheduling algorithm for control-dominated VHDL descriptions

Münch, M.; Wehn, Norbert; Glesner, Manfred

doi:10.1145/268424.268428

Cited by 2 publications

(2 citation statements)

References 12 publications

(8 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Note that similar constraint modeling techniques are used in VOTAN [16]. However, they approach the problem from a retiming perspective and only solve the rescheduling problem.…”

Section: Comparison With Other Approachesmentioning

confidence: 99%

“…Behavioral templates are introduced in [15] to support relative timings by locking a number of operations into certain scheduling templates. VOTAN [16] employs a retiming-based approach to reschedule the timed VHDL by behavioral code transformations but without altering the original I/O timings. I/O timing constraints are also allowed in several exact scheduling approaches, such as the ILP-based scheduling [9,5], the symbolic scheduling [8,21], and the constraint-programmingbased scheduling [12].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An efficient and versatile scheduling algorithm based on SDC formulation

Cong

Zhang

2006

Proceedings of the 43rd Annual Conference on Design Automation - DAC '06

143

View full text Add to dashboard Cite

Scheduling plays a central role in the behavioral synthesis process, which automatically compiles high-level specifications into optimized hardware implementations. However, most of the existing behavior-level scheduling heuristics either have a limited efficiency in a specific class of applications or lack general support of various design constraints.In this paper we describe a new scheduler that converts a rich set of scheduling constraints into a system of difference constraints (SDC) and performs a variety of powerful optimizations under a unified mathematical programming framework. In particular, we show that our SDC-based scheduling algorithm can efficiently support resource constraints, frequency constraints, latency constraints, and relative timing constraints, and effectively optimize longest path latency, expected overall latency, and the slack distribution. Experiments demonstrate that our proposed technique provides efficient solutions for a broader range of applications with higher quality of results (in terms of system performance) when compared to the state-of-the-art scheduling heuristics.

show abstract

“…Note that similar constraint modeling techniques are used in VOTAN [16]. However, they approach the problem from a retiming perspective and only solve the rescheduling problem.…”

Section: Comparison With Other Approachesmentioning

confidence: 99%