Abstract
We present an approach to process scheduling based on an abstract graph representation which captures both data-flow and the flow of control. Target architectures consist of several processors, ASICs and shared busses. We have developed a heuristic which generates a schedule table so that the worst case delay is minimized. Several experiments demonstrate the efficiency of the approach.
| Original language | English |
|---|---|
| Title of host publication | Design, Automation, and Test in Europe |
| Subtitle of host publication | The Most Influential Papers of 10 Years Date |
| Publisher | Springer Netherlands |
| Pages | 15-29 |
| Number of pages | 15 |
| ISBN (Print) | 9781402064876 |
| DOIs | |
| State | Published - 2008 |
Fingerprint
Dive into the research topics of 'Scheduling of conditional process graphs for the synthesis of embedded systems'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver