Abstract
This paper presents a simple to use and general approach for designing efficient parallel algorithms for distributed memory machines. This approach is well suited for solving both regular and irregular problems using dynamic data. It is based on the notion of synchronized iterative algorithms. The idea is to alternate between computation and macro-communication steps, where a macro-communication step is composed of synchronization and load balancing or data redistribution operations. The simplicity and generality of this approach is shown on a theoretical example by proving non trivial lower and upper bounds for the efficiency. Experimental results certify the validity of the approach by parallelizing the best-first branch and bound algorithm for solving traveling salesman problems on a Cray T3D machine.
Research supported by the Swiss National Science Foundation grants SPP-IF 5003-034349 and SPP-IF 5003-034349/2.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. G. Akl. The Design and Analysis of Parallel Algorithms. Prentice-Hall International, Englewood Cliffs, NJ, 1989.
C. G. Diderich and M. Gengler. Solving traveling salesman problems using a parallel synchronized branch and bound algorithm. In Proc. HPCN Europe '96, Brussels, Belgium, April 1996.
M. Dion, M. Gengler, and S. Ubéda. Comparing two probabilistic models of the computational complexity of the branch and bound algorithm. In Proc. CONPAR '94 — VAPP VI, volume 854 of LNCS, pages 359–370. Springer-Verlag, 1994.
D. L. Eager, E. D. Lazowska, and J. Zahorjan. Adaptive load sharing in homogeneous distributed system. IEEE Trans. Software Engrg., 12(5):662–675, 1986.
M. Gengler and G. Coray. A parallel best-first b&b algorithm and its axiomatization. Parallel Algo. and Appl., 2:60–80, 1994.
K. Hwang and F. A. Briggs. Computer Architectures and Parallel Processing, chapter 8 — Multiprocessing Control and Algorithms, pages 613–636. McGraw-Hill, New York, NY, 1984.
B. W. Wah and C. F. Yu. Probabilistic modeling of branch and bound algorithms. In Proc. COMPSAC, pages 647–653, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Diderich, C.G., Gengler, M. (1996). Synchronization as a strategy for designing efficient parallel algorithms. In: Ferreira, A., Rolim, J., Saad, Y., Yang, T. (eds) Parallel Algorithms for Irregularly Structured Problems. IRREGULAR 1996. Lecture Notes in Computer Science, vol 1117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030113
Download citation
DOI: https://doi.org/10.1007/BFb0030113
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61549-1
Online ISBN: 978-3-540-68808-2
eBook Packages: Springer Book Archive