A formal approach to the scheduling problem in high level synthesis

Authors:
C. -T. Hwang;J. -H. Lee;Y. -C. Hsu
Affiliations:
Dept. of Comput. Sci., Tsing Hua Univ., Hsin-Chu;-;-
Venue:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Year:
2006

Citing 0
Cited 13

Unified assign and schedule: a new approach to scheduling for clustered register file microarchitectures

MICRO 31 Proceedings of the 31st annual ACM/IEEE international symposium on Microarchitecture
Scheduling using mixed arithmetic: an ILP formulation

EDTC '97 Proceedings of the 1997 European conference on Design and Test
Verification method of dataflow algorithms in high-level synthesis

Journal of Systems and Software
A hybrid Branch-and-Bound and evolutionary approach for allocating strings of applications to heterogeneous distributed computing systems

Journal of Parallel and Distributed Computing
Pre-synthesis resource generation and estimation for transport-triggered architecture (TTA)-like architecture

Microprocessors & Microsystems
High level synthesis of integrated heterogeneous pipelined processing elements for DSP applications

Computers and Electrical Engineering
Finding the best compromise in compiling compound loops to Verilog

Journal of Systems Architecture: the EUROMICRO Journal
Variable assignment and instruction scheduling for processor with multi-module memory

Microprocessors & Microsystems
Multi-objective efficient design space exploration and architectural synthesis of an application specific processor (ASP)

Microprocessors & Microsystems
A heuristic scheduler for port-constrained floating-point pipelines

International Journal of Reconfigurable Computing
The benefits of using variable-length pipelined operations in high-level synthesis

ACM Transactions on Embedded Computing Systems (TECS)
Bound-oriented parallel pruning approaches for efficient resource constrained scheduling of high-level synthesis

Proceedings of the Ninth IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis
SDC-based modulo scheduling for pipeline synthesis

Proceedings of the International Conference on Computer-Aided Design

Quantified Score

Hi-index	0.03

Visualization

Abstract

An integer linear programming (ILP) model for the scheduling problem in high-level synthesis is presented. In addition to time-constrained scheduling and resource-constrained scheduling, a scheduling problem called feasible scheduling, which provides a paradigm for exploring the solution space, is constructed. Extensive consideration is given to the following applications: scheduling with chaining, multicycle operations by nonpipelined function units, and multicycle operations by pipelined function units; functional pipelining; loop folding; mutually exclusive operations; scheduling under bus constraint; and minimizing lifetimes of variables. The complexity of the number of variables in the formulation is O( s×n) where s and n are the number of control steps and operations, respectively. Since the as soon as possible (ASAP), as late as possible (ALAP), and list scheduling techniques are used to reduce the solution space, the formulation becomes very efficient. A solution to a practical problem, such as the fifth-order filter, can be found optimally in a few seconds