Task scheduling in multiprocessing systems using duplication

Authors:
Pranay Chaudhuri;Jeffrey Elcock
Affiliations:
Department of Computer Science, Mathematics and Physics, University of the West Indies, Cave Hill Campus, P.O. Box 64, Bridgetown, Barbados;Department of Computer Science, Mathematics and Physics, University of the West Indies, Cave Hill Campus, P.O. Box 64, Bridgetown, Barbados
Venue:
Journal of Systems Architecture: the EUROMICRO Journal
Year:
2008

Citing 8
Cited 0

Analysis and evaluation of heuristic methods for static task scheduling

Journal of Parallel and Distributed Computing
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
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
An Improved Duplication Strategy for Scheduling Precedence Constrained Graphs in Multiprocessor Systems

IEEE Transactions on Parallel and Distributed Systems
An Efficient Scheduling Algorithm for Dependent Tasks

CIT '04 Proceedings of the The Fourth International Conference on Computer and Information Technology
Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Task scheduling continues to be one of the most challenging problems in both parallel and distributed computing environments. In this paper, we present a task scheduling algorithm, which uses duplication, to optimally schedule any application represented in the form of a directed acyclic graph (DAG). It has a time complexity of O(d|V|^3), where |V| represents the number of tasks and d the maximum indegree of tasks.