Publication
HICSS 1990
Conference paper
Path-based scheduling for synthesis
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.