Formulation and evaluation of scheduling techniques for control flow graphs
- 1 January 1995
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
This paper presents a theoretical basis for scheduling approaches based on purely control-flow graphs. This formulation includes a control flow graph model based on a finite discrete-time homogeneous Markov chain suitable to represent complex control structures. A probabilistic finite state machine is introduced to model the resulting schedule and evalute the effectiveness of the scheduling approaches for control flow graphs. The need of such models is imposed by the nature of real time systems in which the control sequence depends on external conditionsKeywords
This publication has 5 references indexed in Scilit:
- PPS: a pipeline path-based schedulerPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Performance analysis and optimization of schedules for conditional and loop-intensive specificationsPublished by Association for Computing Machinery (ACM) ,1994
- The Synthesis Approach to Digital System DesignPublished by Springer Nature ,1992
- Path-based scheduling for synthesisIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1991
- Force-directed scheduling for the behavioral synthesis of ASICsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1989