BROWSE
Detail
Journal Article
Push-Pull: Deterministic Search-Based DAG Scheduling for Heterogeneous Cluster Systems
Cited 42 time in 
Share 
Share
- Authors
- Sang Cheol Kim, Sung Gu Lee, Jaeg Yoon Hahm
- Issue Date
- 2007-11
- Citation
- IEEE Transactions on Parallel and Distributed Systems, v.18, no.11, pp.1489-1502
- ISSN
- 1045-9219
- Publisher
- IEEE
- Language
- English
- Type
- Journal Article
- Abstract
- Consider DAG scheduling for a large heterogeneous system, which consists of processors with varying processing capabilities and network links with varying bandwidths. The search space of possible task schedules for this problem is immense. One possible approach for this optimization problem, which is NP-hard, is to start with the best task schedule found by a fast deterministic task scheduling algorithm, and then iteratively attempt to improve the task schedule by employing a general random guided search method. However, such an approach can lead to extremely long search times, and the solutions found are sometimes not significantly better than those found by the original deterministic task scheduling algorithm. In this paper, we propose an alternative strategy, termed Push-Pull, which starts with the best task schedule found by a fast deterministic task scheduling algorithm, and then iteratively attempts to improve the current best solution using a deterministic guided search method. Our simulation results show that, given similar running times, the Push-Pull algorithm performs well, achieving similar or better results than all of the other algorithms being compared. © 2007 IEEE.
- KSP Keywords
- DAG scheduling, Heterogeneous cluster systems, NP-hard, Optimization problem, PULL algorithm, Search Space, Search-based, Task scheduling algorithm, heterogeneous systems, push-pull, search method