Title :
Optimal scheduling of finite-state machines
Author :
Yen, Ti-Yen ; Wolf, Wayne
Author_Institution :
Dept. of Electr. Eng., Princeton Univ., NJ, USA
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 :
finite state machines; logic CAD; logic design; scheduling; conditional branches; constraint system; equality constraints; finite-state machines; multiple loops; multiple, interlocking cycles; optimal scheduling; scheduling constraints; state transition graphs; toroidal compaction; Algorithm design and analysis; Clocks; Compaction; Control systems; High level synthesis; Optimal scheduling; Scheduling algorithm; Timing; Upper bound; Wrapping;
Conference_Titel :
Computer Design: VLSI in Computers and Processors, 1993. ICCD '93. Proceedings., 1993 IEEE International Conference on
Conference_Location :
Cambridge, MA
Print_ISBN :
0-8186-4230-0
DOI :
10.1109/ICCD.1993.393351
