A fast approach to computing exact solutions to the resource-constrained scheduling problem

Authors:
M. Narasimhan;J. Ramanujam
Affiliations:
Louisiana State University, Baton Rouge;Louisiana State University, Baton Rouge
Venue:
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Year:
2001

Citing 6
Cited 12

Integer and combinatorial optimization

Integer and combinatorial optimization
Analyzing and exploiting the structure of the constraints in the ILP approach to the scheduling problem

IEEE Transactions on Very Large Scale Integration (VLSI) Systems - Special issue on low-power design
A recursive technique for computing lower-bound performance of schedules

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Recent developments in high-level synthesis

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Synthesis and Optimization of Digital Circuits

Synthesis and Optimization of Digital Circuits
High-Level VLSI Synthesis

High-Level VLSI Synthesis

On lower bounds for scheduling problems in high-level synthesis

Proceedings of the 37th Annual Design Automation Conference
A near-optimal instruction scheduler for a tightly constrained, variable instruction set embedded processor

CASES '02 Proceedings of the 2002 international conference on Compilers, architecture, and synthesis for embedded systems
Effective Compilation Support for Variable Instruction Set Architecture

Proceedings of the 2002 International Conference on Parallel Architectures and Compilation Techniques
Variable Instruction Set Architecture and Its Compiler Support

IEEE Transactions on Computers
Optimal Superblock Scheduling Using Enumeration

Proceedings of the 37th annual IEEE/ACM International Symposium on Microarchitecture
Instruction scheduling using MAX-MIN ant system optimization

GLSVLSI '05 Proceedings of the 15th ACM Great Lakes symposium on VLSI
Parallel scheduling of complex dags under uncertainty

Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Data-Dependency Graph Transformations for Instruction Scheduling

Journal of Scheduling
Optimal trace scheduling using enumeration

ACM Transactions on Architecture and Code Optimization (TACO)
An in-place search algorithm for the resource constrained scheduling problem during high-level synthesis

ACM Transactions on Design Automation of Electronic Systems (TODAES)
A heuristic scheduler for port-constrained floating-point pipelines

International Journal of Reconfigurable Computing
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article presents an algorithm that substantially reduces the computational effort required to obtain the exact solution to the Resource Constrained Scheduling (RCS) problem. The reduction is obtained by (a) using a branch-and-bound search technique, which computes both upper and lower bounds, and (b) using efficient techniques to accurately estimate the possible time-steps at which each operation can be scheduled and using this to prune the search space. Results on several benchmarks with varying resource constraints indicate the clear superiority of the algorithm presented here over traditional approaches using integer linear programming, with speed-ups of several orders of magnitude.