Process scheduling in heterogeneous multiprocessor systems

Authors:
Pranay Chaudhuri;Jeffrey Elcock
Affiliations:
University of the West Indies, Bridgetown, Barbados;University of the West Indies, Bridgetown, Barbados
Venue:
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
Year:
2007

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
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
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
An Improved Duplication Strategy for Scheduling Precedence Constrained Graphs in Multiprocessor Systems

IEEE Transactions on Parallel and Distributed Systems
Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

In heterogeneous parallel and distributed computing environments, task scheduling continues to be one of the most challenging problems. This paper investigates the Heterogeneous Earliest Finish Time (HEFT) algorithm, along with its alternative scheduling policies for the task prioritising phases, and the Critical Path on a Processor (CPOP) for scheduling tasks on a heterogeneous multiprocessor system. It is shown 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 has a time complexity of O(|V|2(p + d)), where |V| represents the number of tasks, p represents the number of processors and d the maximum in-degree of tasks.