Abstract
This article is concerned with the problem of scheduling a parallel application depicted by a precedence graph in presence of large communication delays. The target architecture is constituted of a bounded number m of identical processors linked together by an interconnection network. Communication delays represent the time of data transfer between two tasks of the application allocated to different processors. Our objective is to find an allocation of tasks to the processors and an execution order on each machine such that the overall completion time is minimized. We consider the special case of unit execution time for all computation tasks and a uniform communication delay ρ. We present a new approach based on the reduction of the problem to the successive schedulings of “small graphs”, roughly speaking graphs which can be scheduled in time at most ρ + 1 on an unbounded number of processors. Allowing duplication, corresponding to the recomputation of some of the tasks, this technique allows us to derive an asymptotic \( \mathcal{O} \)(ln ρ/ ln ln ρ)-approximation algorithm for general precedence graph structure.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
I. Ahmad and Y.-K. Kwok. On exploiting task duplication in parallel program scheduling. IEEE Transactions on Parallel and Distributed Systems, 9(9):872–892, 1998.
E. Bampis, A. Giannakos, and J-C. Konig. On the complexity of scheduling with large communication delays. European Journal of Operations Research, 94:252–260, 1996.
D. Darbha and D. P. Agrawal. Optimal scheduling algorithm for distributedmemory machines. IEEE Transactions on Parallel and Distributed Systems, 9(1):87–95, 1998.
A. Gerasoulis and T. Yang. On the granularity and clustering of directed acyclic graphs. IEEE Transaction on Parallel and Distributed Systems, 4:186–201, 1993.
R. L. Graham. Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics, 17(2):416–429, March 1969.
C. Hanen and A. Munier. Using duplication for scheduling unitary tasks on m processors with communication delays. Theoretical Computer Science, 178:119–127, 1997.
D. S. Hochbaum and A. Pathria. Analysis of the greedy approach in covering problems. Naval Research Quaterly, 45:615–627, 1998.
J. Hoogeveen, J.-K. Lenstra, and B. Veltman. Three, four, five, six, or the complexity of scheduling with communication delays. Operations Research Letters, 16:129–137, 1994.
C-Y. Lee, J-J. Hwang, Y-C. Chow, and F. D. Anger. Scheduling precedence graphs in systems with interprocessor communication times. SIAM Journal on Computing, 18(2):244–257, April 1989.
Z. Liu. Worst-case analysis of scheduling heuristics of parallel systems. Parallel Computing, 24(5–6):863–891, 1998.
A. Munier. Approximation algorithms for scheduling trees with general communication delays. To appear in Parallel Computing,-. Postcript version available at http://www-poleia.lip6.fr/munier/arbres.ps.gz.
A. Munier, M. Queyranne, and A. Schulz. Approximation bounds for a general class of precedence constrained parallel machine scheduling problems. In Proceedings of Integer Programming and Combinatorial Optimization (IPCO), volume 1412 of Lecture Notes in Computer Science, pages 367–382, 1998.
M. A. Palis, J-C. Liou, and D. S. L. Wei. Task Clustering and Scheduling for Distributed Memory Parallel Architectures. IEEE Transactions on Parallel and Distributed Systems, 7(1):46–55, 1996.
C. Papadimitriou and M. Yannakakis. Towards an architecture-independent analysis of parallel algorithms. SIAM Journal on Computing, 19(2):322–328, 1990.
C. H. Papadimitriou and M. Yannakakis. Scheduling interval-ordered tasks. SIAM Journal on Computing, 8(3):405–409, August 1979.
C. Picouleau. Two new NP-complete scheduling problems with communication delays and unlimited number of processors. Discrete Applied Mathematics, 60:331–342, 1995.
V. J. Rayward-Smith. UET scheduling with unit interprocessor communication delays. Discrete Applied Mathematics, 18:55–71, 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lepere, R., Rapine, C. (2002). An Asymptotic \( \mathcal{O} \) (ln ρ/ ln ln ρ)-Approximation Algorithm for the Scheduling Problem with Duplication on Large Communication Delay Graphs. In: Alt, H., Ferreira, A. (eds) STACS 2002. STACS 2002. Lecture Notes in Computer Science, vol 2285. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45841-7_12
Download citation
DOI: https://doi.org/10.1007/3-540-45841-7_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43283-8
Online ISBN: 978-3-540-45841-8
eBook Packages: Springer Book Archive