Title :
Path-based scheduling for synthesis
Author_Institution :
IBM Thomas J. Watson Res. Center, Yorktown Heights, NY
Abstract :
A path-based scheduling algorithm for synchronous digital systems is presented. It yields solutions with the minimum number of control steps, taking into account arbitrary constraints that limit the amount of operations in each control step. The result is a finite-state machine that implements the control. Although the complexity of the algorithm is proportional to the number of paths in the control-flow graph, it is shown to be practical for large examples with thousands of nodes
Keywords :
circuit CAD; computational complexity; finite automata; scheduling; arbitrary constraints; complexity; control-flow graph; finite-state machine; path-based scheduling algorithm; synchronous digital systems; Automata; Clocks; Control systems; Costs; Digital systems; Force control; Hardware; High level synthesis; Pipelines; Strain control;
Conference_Titel :
System Sciences, 1990., Proceedings of the Twenty-Third Annual Hawaii International Conference on
Conference_Location :
Kailua-Kona, HI
DOI :
10.1109/HICSS.1990.205135
