Title :
Ensemble representation and techniques for exact control-dependent scheduling
Author :
Radivojevic, I. ; Brewer, Forrest
Author_Institution :
Dept. of Electr. & Comput. Eng., California Univ., Santa Barbara, CA, USA
Abstract :
Describes a new exact formulation of control/data-flow scheduling. Unlike current techniques, 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 ordered binary decision diagram (OBDD) based representation. A robust, iterative construction strategy is presented along with benchmark results. An advantage of this construction is that initial bounds for the number of clock cycles are no longer needed for exact formulations. This strategy also allows the simple formulation of several set-based heuristics as well as controlling the growth of the BDD representation
Keywords :
decision tables; diagrams; iterative methods; logic design; parallel processing; scheduling; BDD representation growth; arbitrary forward branching control; benchmark results; clock cycles; closed form solution set; compressed OBDD based representation; data paths; data-flow scheduling; ensemble representation; exact control-dependent scheduling; exact formulation; initial bounds; ordered binary decision diagram; resource constraints; robust iterative construction strategy; set-based heuristics; Binary decision diagrams; Boolean functions; Clocks; Closed-form solution; Control systems; Force control; Processor scheduling; Robustness; Runtime; Tree graphs;
Conference_Titel :
High-Level Synthesis, 1994., Proceedings of the Seventh International Symposium on
Conference_Location :
Niagara-on-the-Lake, Ont.
Print_ISBN :
0-8186-5785-5
DOI :
10.1109/ISHLS.1994.302340
