Ensemble representation and techniques for exact control-dependent scheduling
- 17 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
This paper describes a new exact formulation of control/data-flow scheduling. Unlike current tech-niques, a closed form solution set is generated in which all satisfying schedules for arbitrary forward branching control/data paths and resource constraints are encapsulated in a compressed OBDD-based repre-sentation. A robust, iterative construction strategy is presented along with benchmark results. An advantage of this construction is that initial bounds for the num-ber of clock cycles are no longer needed for exact for-mulations. This strategy also allows the simple formulation of several set-based heuristics as well as controlling the growth of the BDD representation.Keywords
This publication has 15 references indexed in Scilit:
- A resource sharing and control synthesis method for conditional branchesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Optimal scheduling and allocation of embedded VLSI chipsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Global scheduling independent of control dependencies based on condition vectorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Scheduling with environmental constraints based on automata representationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A scheduling algorithm for conditional resource sharingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Incorporating speculative execution in exact control-dependent schedulingPublished by Association for Computing Machinery (ACM) ,1994
- A tree-based scheduling algorithm for control-dominated circuitsPublished by Association for Computing Machinery (ACM) ,1993
- On the OBDD-representation of general Boolean functionsIEEE Transactions on Computers, 1992
- Force-directed scheduling for the behavioral synthesis of ASICsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1989
- MAHA: A Program for Datapath SynthesisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986