About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Integration, the VLSI Journal
Paper
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.