A New Approach to Scheduling Parallel Programs Using Task Duplication
- 1 August 1994
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 47-51
- https://doi.org/10.1109/icpp.1994.37
Abstract
In this paper, we explore the problem of scheduling parallel programs using task duplication for message-passing multicomputers. Task duplication means scheduling a parallel program by redundantly executing some of the tasks on which other tasks of the program critically depend. This can reduce the start times of tasks waiting for messages from tasks residing in other processors. There have been a few scheduling algorithms using task duplication. We discuss two such previously reported algorithms and describe their differences, limitations and suitability for different environments. A new algorithm is proposed which outperforms both of these algorithms, and is more efficient for low as well as high values of communication-to-computation ratios. The algorithm takes into account arbitrary computation and communication costs. All three algorithms are tested by scheduling some of the commonly encountered graph structures.Keywords
This publication has 5 references indexed in Scilit:
- Declustering: a new multiprocessor scheduling techniqueIEEE Transactions on Parallel and Distributed Systems, 1993
- Towards an Architecture-Independent Analysis of Parallel AlgorithmsSIAM Journal on Computing, 1990
- Grain size determination for parallel processingIEEE Software, 1988
- Optimal Scheduling Strategies in a Multiprocessor SystemIEEE Transactions on Computers, 1972
- Parallel Sequencing and Assembly Line ProblemsOperations Research, 1961