Optimal scheduling of task graphs on parallel systems

Authors:
Oliver Sinnen;Alexei Vladimirovich Kozlov;Ahmed Zaki Semar Shahul
Affiliations:
Department of Electrical and Computer Engineering, University of Auckland, Auckland, New Zealand;Department of Electrical and Computer Engineering, University of Auckland, Auckland, New Zealand;Department of Electrical and Computer Engineering, University of Auckland, Auckland, New Zealand
Venue:
PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
Year:
2007

Citing 9
Cited 1

UET scheduling with unit interprocessor communication delays

Discrete Applied Mathematics
Artificial Intelligence: A Modern Approach

Artificial Intelligence: A Modern Approach
Benchmarking the Task Graph Scheduling Algorithms

IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
An Incremental Genetic Algorithm Approach to Multiprocessor Scheduling

IEEE Transactions on Parallel and Distributed Systems
Communication Contention in Task Scheduling

IEEE Transactions on Parallel and Distributed Systems
Iterative list scheduling for heterogeneous computing

Journal of Parallel and Distributed Computing
Toward a Realistic Task Scheduling Model

IEEE Transactions on Parallel and Distributed Systems
A high performance, low complexity algorithm for compile-time task scheduling in heterogeneous systems

Parallel Computing - Heterogeneous computing
On multiprocessor task scheduling using efficient state space search approaches

Journal of Parallel and Distributed Computing

Support for Fine Grained Dependent Tasks in OpenMP

IWOMP '07 Proceedings of the 3rd international workshop on OpenMP: A Practical Programming Model for the Multi-Core Era

Quantified Score

Hi-index	0.00

Visualization

Abstract

Scheduling tasks onto the processors of a parallel system is a crucial part of program parallelisation. Due to the NP-hardness of the task scheduling problem, scheduling algorithms are based on heuristics that try to produce good rather than optimal schedules. Nevertheless, in certain situations it is desirable to have optimal schedules, for example for time critical systems or to evaluate scheduling heuristics. This paper proposes a scheduling algorithm based on A* that can produce optimal schedules in reasonable time for small task graphs. A* is a best-first state space search algorithm. In comparison to a previous approach, the here presented scheduling algorithm has a significantly reduced search space due to a much improved cost function f(s) and additional pruning techniques. Experimental results reveal the relation between the runtime of the algorithm and the structure of the task graphs. Further, it is shown that the proposed algorithm significantly outperforms the previous approach.