Optimal scheduling of finite-state machines
- 30 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 366-369
- https://doi.org/10.1109/iccd.1993.393351
Abstract
The paper describes an algorithm for solving scheduling problems which contain multiple, interlocking cycles, such as scheduling constraints in state transition graphs. This algorithm is based on previous work on toroidal compaction but introduces three significant improvements: it allows the designer to use upper bound or equality constraints; it does not require an initial feasible solution; and it can handle multiple loops and conditional branches in the constraint system. Experimental results demonstrate the algorithm's effectiveness.Keywords
This publication has 5 references indexed in Scilit:
- The Princeton University behavioral synthesis systemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Path-based scheduling for synthesisIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1991
- Software pipelining: an effective scheduling technique for VLIW machinesPublished by Association for Computing Machinery (ACM) ,1988
- Data Structures and Algorithms 1Published by Springer Nature ,1984
- An Algorithm to Compact a VLSI Symbolic Layout with Mixed ConstraintsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983