Scheduling under resource constraints and module assignment

Abstract

Algorithms for considering resource constraints and automatic module assignment during scheduling, are presented. These techniques are applied during As-Fast-As-Possible (AFAP) path-based scheduling. They ensure the minimum number of control steps for all possible sequences of operations in the control-flow graph, under given resource constraints including multifunction functional units. Furthermore, they decide on which type of hardware resource each operation is implemented. Storage requirements are minimized during scheduling, based on data-flow analysis. Results from several benchmark examples are presented and compared with existing systems. © 1991.