An Optimal Scheduling Algorithm Based on Task Duplication

Authors:
C. I. Park;T. Y. Choe
Affiliations:
-;-
Venue:
IEEE Transactions on Computers
Year:
2002

Citing 5
Cited 9

Towards an architecture-independent analysis of parallel algorithms

SIAM Journal on Computing
Task Clustering and Scheduling for Distributed Memory Parallel Architectures

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

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
Grain Size Determination for Parallel Processing

IEEE Software

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
Iterative list scheduling for heterogeneous computing

Journal of Parallel and Distributed Computing
A semi-static approach to mapping dynamic iterative tasks onto heterogeneous computing systems

Journal of Parallel and Distributed Computing
Task scheduling in multiprocessing systems using duplication

Journal of Systems Architecture: the EUROMICRO Journal
Process scheduling in heterogeneous multiprocessor systems

PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
An Executing Method for Time and Energy Optimization in Heterogeneous Computing

GREENCOM '11 Proceedings of the 2011 IEEE/ACM International Conference on Green Computing and Communications
Critical-Task anticipation scheduling algorithm for heterogeneous and grid computing

ACSAC'06 Proceedings of the 11th Asia-Pacific conference on Advances in Computer Systems Architecture
Process Scheduling in Heterogeneous Multiprocessor Systems Using Task Duplication

International Journal of Business Data Communications and Networking

Quantified Score

Hi-index	14.98

Visualization

Abstract

Under the condition where communication time is relatively shorter than the computation time for a given task, the task duplication-based scheduling (TDS) algorithm proposed by Darbha and Agrawal generates an optimal schedule. In this paper, we propose an extended TDS algorithm whose optimality condition is less restricted and the length of the generated schedule is shorter than the TDS algorithm.