A Realistic Model and an Efficient Heuristic for Scheduling with Heterogeneous Processors
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Exploiting Unused Time Slots in List Scheduling Considering Communication Contention
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
On Task Scheduling Accuracy: Evaluation Methodology and Results
The Journal of Supercomputing
Scheduling Strategies for Master-Slave Tasking on Heterogeneous Processor Platforms
IEEE Transactions on Parallel and Distributed Systems
Data parallel scheduling of operations in linear algebra on heterogeneous clusters
DIWEB'06 Proceedings of the 5th WSEAS International Conference on Distance Learning and Web Engineering
Mapping pipeline skeletons onto heterogeneous platforms
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Abstract: In the area of static scheduling, list scheduling is one of the most common heuristics for the temporal and spatial assignment of a Directed Acyclic Graph (DAG) to a target machine. As most heuristics, list scheduling assumes fully connected homogeneous processors and ignores contention on the inter communication links. This article extends the list scheduling heuristic for contention aware scheduling on heterogenous arbitrary machines. The extention is based on the idea of scheduling edges to links, likewise the scheduling of nodes to processors. Based on this extension, we compare eight priority schemes for the node order determination of the first phase of list scheduling. Random graphs are generated and scheduled with the different schemes to homogenous and heterogenous parallel systems from the area of cluster computing. The experiments demonstrate the appropriateness of our extended list scheduling for homogeneous and heterogenous cluster architectures.