Posterior task scheduling algorithms for heterogeneous computing systems

Authors:
Linshan Shen;Tae-Young Choe
Affiliations:
School of Computer Engineering, Kumoh National Institute of Technology, Kumi city, KyungPook, Korea;School of Computer Engineering, Kumoh National Institute of Technology, Kumi city, KyungPook, Korea
Venue:
VECPAR'06 Proceedings of the 7th international conference on High performance computing for computational science
Year:
2006

Citing 14
Cited 1

Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors

IEEE Transactions on Parallel and Distributed Systems
Optimal Scheduling Algorithm for Distributed-Memory Machines

IEEE Transactions on Parallel and Distributed Systems
On Exploiting Task Duplication in Parallel Program Scheduling

IEEE Transactions on Parallel and Distributed Systems
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing

IEEE Transactions on Parallel and Distributed Systems
A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures

IEEE Transactions on Parallel and Distributed Systems
A Genetic Algorithm for Multiprocessor Scheduling

IEEE Transactions on Parallel and Distributed Systems
DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors

IEEE Transactions on Parallel and Distributed Systems
DFRN: A New Approach for Duplication Based Scheduling for Distributed Memory Multiprocessor Systems

IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
A Comparison of General Approaches to Multiprocessor Scheduling

IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Fast and Effective Task Scheduling in Heterogeneous Systems

HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
A Task Duplication Based Scheduling Algorithm for Heterogeneous Systems

IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
LDBS: A Duplication Based Scheduling Algorithm for Heterogeneous Computing Systems

ICPP '02 Proceedings of the 2002 International Conference on Parallel Processing
Improving Scheduling of Tasks in a Heterogeneous Environment

IEEE Transactions on Parallel and Distributed Systems
Levelized Scheduling of Directed A-Cyclic Precedence Constrained Task Graphs onto Heterogeneous Computing System

DFMA '05 Proceedings of the First International Conference on Distributed Frameworks for Multimedia Applications

An effective duplication-based task-scheduling algorithm for heterogeneous systems

Simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The task scheduling problem in heterogeneous system is known as NP-hard. Recently, Bajaj and Agrawal proposed an algorithm TANH (Task duplication-based scheduling Algorithm for Network of Heterogeneous systems) with optimality conditions, which are wider than previous optimality conditions. TANH algorithm combines the clustering technique with task duplication. We propose two postprocessing algorithms, HPSA1 (Heterogeneous Posterior Scheduling Algorithm) and HPSA2, to reduce the schedule length for DAGs which don't satisfy the optimality conditions of TANH algorithm. Our algorithms reduce the schedule length by exchanging task clusters in which its parent tasks reside. We compare with HCNF (Heterogeneous Critical Node First) algorithm by illustrating an example to show how our algorithms operate.