Scheduling precedence graphs in systems with interprocessor communication times
SIAM Journal on Computing
Automatic determination of grain size for efficient parallel processing
Communications of the ACM - Special issue: multiprocessing
Scheduling parallel program tasks onto arbitrary target machines
Journal of Parallel and Distributed Computing - Special issue: software tools for parallel programming and visualization
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
A two-pass scheduling algorithm for parallel programs
Parallel Computing
Task Clustering and Scheduling for Distributed Memory Parallel Architectures
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Optimal Scheduling Algorithm for Distributed-Memory Machines
IEEE Transactions on Parallel and Distributed Systems
Safety and Reliability Driven Task Allocation in Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
On Exploiting Task Duplication in Parallel Program Scheduling
IEEE Transactions on Parallel and Distributed Systems
Benchmarking and comparison of the task graph scheduling algorithms
Journal of Parallel and Distributed Computing
Static scheduling algorithms for allocating directed task graphs to multiprocessors
ACM Computing Surveys (CSUR)
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing
IEEE Transactions on Parallel and Distributed Systems
Low-Cost Task Scheduling for Distributed-Memory Machines
IEEE Transactions on Parallel and Distributed Systems
An Optimal Scheduling Algorithm Based on Task Duplication
IEEE Transactions on Computers
Hypertool: A Programming Aid for Message-Passing Systems
IEEE Transactions on Parallel and Distributed Systems
Fast Allocation of Processes in Distributed and Parallel Systems
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Journal of Parallel and Distributed Computing - Problems in parallel and distributed computing: Solutions based on evolutionary paradigms
A Dynamic Matching and Scheduling Algorithm for Heterogeneous Computing Systems
HCW '98 Proceedings of the Seventh Heterogeneous Computing Workshop
Scalable scheduling for symmetric multiprocessors (SMP)
Journal of Parallel and Distributed Computing
A Bottom-Up Approach to Task Scheduling on Distributed Memory Multiprocessors
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 02
Scheduling workflow applications on processors with different capabilities
Future Generation Computer Systems - Collaborative and learning applications of grid technology
Journal of Parallel and Distributed Computing
Optimal scheduling of task graphs on parallel systems
PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Scheduling workflow applications on processors with different capabilities
Future Generation Computer Systems - Collaborative and learning applications of grid technology
List scheduling with duplication for heterogeneous computing systems
Journal of Parallel and Distributed Computing
Reliability-aware scheduling strategy for heterogeneous distributed computing systems
Journal of Parallel and Distributed Computing
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part II
A hierarchical reliability-driven scheduling algorithm in grid systems
Journal of Parallel and Distributed Computing
Resource management of distributed virtual machines
International Journal of Ad Hoc and Ubiquitous Computing
Stochastic DAG scheduling using a Monte Carlo approach
Journal of Parallel and Distributed Computing
Robust static resource allocation of DAGs in a heterogeneous multicore system
Journal of Parallel and Distributed Computing
Hi-index | 0.01 |
Optimal scheduling of parallel applications on distributed computing systems represented by directed acyclic graph (DAG) is NP-complete in the general case. List scheduling is a very popular heuristic method for DAG-based scheduling. However, it is more suited to homogenous distributed computing systems. This paper presents an iterative list scheduling algorithm to deal with scheduling on heterogeneous computing systems. The main idea in this iterative scheduling algorithm is to improve the quality of the schedule in an iterative manner using results from previous iterations. The algorithm first uses the heterogeneous earliest-finish-time (HEFT) algorithm to find an initial schedule and iteratively improves it. Hence the algorithm can potentially produce shorter schedule length. The simulation results show that in the majority of the cases, there is significant improvement to the initial schedule. The algorithm is also found to perform best when the tasks to processors ratio is large.