DocumentCode
1270043
Title
Path-based scheduling for synthesis
Author
Camposano, Raul
Author_Institution
IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
Volume
10
Issue
1
fYear
1991
fDate
1/1/1991 12:00:00 AM
Firstpage
85
Lastpage
93
Abstract
A novel path-based scheduling algorithm 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
computational complexity; directed graphs; finite automata; scheduling; as fast as possible scheduling; control-flow graph; finite state machine; minimisation; path-based scheduling algorithm; Arithmetic; Automata; Clocks; Cost function; Digital systems; Flow graphs; High level synthesis; Processor scheduling; Proportional control; Scheduling algorithm;
fLanguage
English
Journal_Title
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
Publisher
ieee
ISSN
0278-0070
Type
jour
DOI
10.1109/43.62794
Filename
62794
Link To Document