Abstract
Algorithms for combinatorial search problems such as the travelling salesman problem, the polynomial problem or game-tree searching have been prime candidates for a distributed implementation as these problems offer substantial parallelism on the programm level. However, a number of experimental studies show that naive approaches to distributed combinatorial search tend to yield only a moderate speedup. The problem is to find a communication strategy that is able to limit stand-stills and superfluous searching of individual processors by distributing the work-load and intermediate results among the processors effectively and that causes only moderate communication overhead. To tackle the problem of the diffusion of commonly useful intermediate results between processors linked by “slow” communication lines without shared memory, we propose a formal method to derive optimal and adaptive communication strategies based on Dynamic Programming in Markov Chains. The key idea of our approach is to compare the running time to be expected under the current contents of the local copy of the shared state with the search and communication effort when acquiring the intermediate result of another processor via an exchange of messages. Using this method we study communication strategies for various distributed combinatorial search problems: for the distributed determination of the maximum of a vector, for a distibuted version of a simple variant of alpha-beta pruning, and for distributed branch and bound methods, where we examine the set partitioning problem.
Preview
Unable to display preview. Download preview PDF.
References
Aho, A.V., J.E. Hopcroft und J.D. Ullman, Data Structures and Algorithms, Reading, Mass. u.a., Addison-Wesley, 1985
Cheriton D.R., The V Distributed System, Communications of the ACM, Vol. 31 (March), No. 3, 314–334, 1989
Christofides N., A. Mingozzi, P. Thot, C. Sandi (eds.), Combinatorial Optimization, New York a.o., John Wiley & Sons, 1979
Ferguson C. und R.E. Korf, Distributed Tree Search and its Applications to Alpha-Beta Pruning, Proceedings of the AAAI Conference 1987, 128–132
Finkel R., und U. Manber, DIB — A Distributed Implementation of Backtracking, ACM Transactions on Programming Languages and Systems, Vol. 9, No. 2 April 1987, 235–256
Giloi W.K., Rechnerarchitektur, Heidelberg, Springer, 1981
Howard R.A., Dynamic Probabilistic Systems, Vol. I: Markov Models, Wiley, New York, 1971
Howard R.A., Dynamic Probabilistic Systems, Vol II: Semi-Markov and Decision Processes, New York, 1971
Karp, R.M., und Y. Zhang, A Randomized Parallel Branch-and-Bound Procedure, Working Paper, University of California, Berkeley, 1988
Knuth, D.E. Fundamental Algorithms, Reading, Mass. u.a., Addison-Wesley, 1. The Art of Computer Programming, 1973
Knuth D.E. und R.W. Moore, An Analysis of Alpha-Beta Pruning, Artificial Intelligence, Vol. 6, 293–326, 1975
Kumar V., K. Ramesh und V.N. Rao, Parallel Best-First Search of State-Space Graphs: A Summary of Results, Proceedings of the AAAI Conference 1987, 122–127
Leiserson C.E. und B.M. Maggs, Communication-Efficient Parallel Algorithms for Distributed Random-Access Machines, Algorithmica, Vol. 3 (1988), 53–77
Martin J.J., Bayesian Decision Problems and Markov Chains, R.E. Krieger, New York, 1975
Parberry I., Parallel Complexity Theory, New York u.a., John Wiley & Sons, 1987
Smith D.R., Random Trees and the Analysis of Branch and Bound Procedures, Journal of the Association for Computing Machinery, Vol. 31, No. 1, January 1984, 163–188
Vornberger O. und B. Monien, Parallel Alpha-Beta versus Parallel SSS, in: Barton, Dagless, Reijns (eds): IFIP Conference on Distributed Processing, North-Holland 1987
Vornberger O., Implementing Branch-and-Bound in a Ring of Processors, in: Goos, Hartmanis (eds): Lecture Notes in Computer Science, CONPAR 86 — Conference on Algorithms and Hardware for Parallel Processing, 158–164, Springer, 1986
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Taudes, A. (1989). Communication heuristics in distributed combinatorial search algorithms. In: Bermond, JC., Raynal, M. (eds) Distributed Algorithms. WDAG 1989. Lecture Notes in Computer Science, vol 392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51687-5_49
Download citation
DOI: https://doi.org/10.1007/3-540-51687-5_49
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51687-3
Online ISBN: 978-3-540-46750-2
eBook Packages: Springer Book Archive