Process Scheduling in Heterogeneous Multiprocessor Systems Using Task Duplication

Authors:
Pranay Chaudhuri;Jeffrey Elcock
Affiliations:
Heritage Institute of Technology, India;University of the West Indies, Barbados
Venue:
International Journal of Business Data Communications and Networking
Year:
2010

Citing 8
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
An Optimal Scheduling Algorithm Based on Task Duplication

IEEE Transactions on Computers
An Improved Duplication Strategy for Scheduling Precedence Constrained Graphs in Multiprocessor Systems

IEEE Transactions on Parallel and Distributed Systems
Improving Scheduling of Tasks in a Heterogeneous Environment

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
Dynamic Critical Path Duplication Task Scheduling Algorithm for Distributed Heterogeneous Computing Systems

ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

Scheduling tasks in heterogeneous parallel and distributed computing environments continues to be a challenging problem. In this paper, the authors investigate the Heterogeneous Earliest Finish Time HEFT algorithm, along with alternative scheduling policies for task prioritising phases and the Critical Path on a Processor CPOP for scheduling tasks on a heterogeneous multiprocessor system. The authors show that by combining the HEFT algorithm selection policy with the task duplication strategy, it is possible to further reduce the schedule length produced by both HEFT and CPOP. The process scheduling algorithm presented in this paper compares favourably with other algorithms that use a similar strategy. The proposed algorithm has a time complexity of ?ï戮娄Vï戮娄2p + d, whererepresents the number of tasks, p represents the number of processors and d the maximum in-degree of tasks.