Scheduling under Data and Control Dependencies for Heterogeneous Architectures
International Conference on Computer Design - ICCD, 1998.
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.
Related files: |
ICCD-98.ps.gz | postscript document, compressed (with gzip) |
[DE98] Alex Doboli, Petru Eles, "Scheduling under Data and Control Dependencies for Heterogeneous Architectures", International Conference on Computer Design - ICCD, 1998. |
|