An Algorithm for Task Scheduling in Heterogeneous Distributed Systems Using Task Duplication

Authors:
Pranay Chaudhuri;Amrit Agrawal
Affiliations:
Heritage Institute of Technology, India;Jaypee University of Information Technology, India
Venue:
International Journal of Grid and High Performance Computing
Year:
2011

Citing 6
Cited 0

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

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
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 Taxonomy for Describing Matching and Scheduling Heuristics for Mixed-Machine Heterogeneous Computing Systems

SRDS '98 Proceedings of the The 17th IEEE Symposium on Reliable Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Task scheduling in heterogeneous parallel and distributed computing environment is a challenging problem. Applications identified by parallel tasks can be represented by directed-acyclic graphs DAGs. Scheduling refers to the assignment of these parallel tasks on a set of bounded heterogeneous processors connected by high speed networks. Since task assignment is an NP-complete problem, instead of finding an exact solution, scheduling algorithms are developed based on heuristics, with the primary goal of minimizing the overall execution time of the application or schedule length. In this paper, the overall execution time schedule length of the tasks is reduced using task duplication on top of the Critical-Path-On-a-Processor CPOP algorithm.