Abstract
This paper presents a list-scheduling algorithm for graphs with data and control dependencies. We assume that tasks are partitioned between hardware resources as scheduling takes place after partitioning in our co-synthesis tool. Control dependencies are introduced by if statements, and model complementary functionalities. A detailed discussion of our algorithm is presented. Extensive experimental work shows the effectiveness of our method for generating close-to-optima schedules in short run-times.
| Original language | English |
|---|---|
| Pages | 602-608 |
| Number of pages | 7 |
| State | Published - 1998 |
| Event | Proceedings of the 1998 IEEE International Conference on Computer Design - Austin, TX, USA Duration: Oct 5 1998 → Oct 7 1998 |
Conference
| Conference | Proceedings of the 1998 IEEE International Conference on Computer Design |
|---|---|
| City | Austin, TX, USA |
| Period | 10/5/98 → 10/7/98 |
Fingerprint
Dive into the research topics of 'Scheduling under data and control dependencies for heterogeneous architectures'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver