Path-based scheduling for synthesis
- 1 January 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 10 (1), 85-93
- https://doi.org/10.1109/43.62794
Abstract
A novel path-based scheduling algorithm is presented. It yields solutions with the minimum number of control steps, taking into account arbitrary constraints that limit the amount of operations in each control step. The result is a finite state machine that implements the control. Although the complexity of the algorithm is proportional to the number of paths in the control-flow graph, it is shown to be practical for large examples with thousands of nodes.Keywords
This publication has 18 references indexed in Scilit:
- Requirements for optimal execution of loops with testsIEEE Transactions on Parallel and Distributed Systems, 1992
- The high-level synthesis of digital systemsProceedings of the IEEE, 1990
- Force-directed scheduling for the behavioral synthesis of ASICsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1989
- The V compiler: automatic hardware designIEEE Design & Test of Computers, 1989
- Synthesizing circuits from behavioural descriptionsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1989
- A compilation technique for software pipelining of loops with conditional jumpsPublished by Association for Computing Machinery (ACM) ,1987
- Automated Synthesis of Data Paths in Digital SystemsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1986
- MAHA: A Program for Datapath SynthesisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Optimizing Synchronous Circuitry by Retiming (Preliminary Version)Published by Springer Nature ,1983
- Recent Developments in Deterministic Sequencing and Scheduling: A SurveyPublished by Springer Nature ,1982