SYMBOLIC SCHEDULING TECHNIQUES

This paper describes an exact symbolic formulation of resource-constra ined scheduling which allows speculative operation execution in arbitr ary forward-branching control/data paths. The technique provides a clo sed-form solution set in which all satisfying schedules are encapsulat ed in a compressed OBDD-based representation. An iterative constructio n method is presented along with benchmark results. The experiments de monstrate the ability of the proposed technique to efficiently extract parallelism not explicitly specified in the input description.