SALSA: a new approach to scheduling with timing constraints
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
First, an initial schedule that satisfies all timing constraints is generated using algorithms adapted from layout compaction. This schedule is then improved with respect to resource usage using simulated annealing. SALSA provides for efficient exploration of alternative schedules while supporting timing constraints, conditionals, loops, and subroutines. The SALSA scheduling procedure is described in detail. An implementation of the approach shows promising results.Keywords
This publication has 11 references indexed in Scilit:
- A resource sharing and control synthesis method for conditional branchesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- High-level synthesis: current status and future directionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- The high-level synthesis of digital systemsProceedings of the IEEE, 1990
- Relative scheduling under timing constraintsPublished by Association for Computing Machinery (ACM) ,1990
- Algorithmic and Register-Transfer Level Synthesis: The System Architect’s WorkbenchPublished by Springer Nature ,1990
- Algorithms for hardware allocation in data path synthesisIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1989
- Automatic production of controller specifications from control and timing behavioral descriptionsPublished by Association for Computing Machinery (ACM) ,1989
- Symbolic Layout and Procedural DesignPublished by Springer Nature ,1987
- MAHA: A Program for Datapath SynthesisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Optimization by Simulated AnnealingScience, 1983