Abstract
A set of personal computers is connected to form a ring structured parallel system: Each processor has access to its local memory and can exchange messages with its two ring neighbors.
A branch-and-bound procedure is implemented in Pascal to run in parallel on the ring and solve the Travelling-Salesman-Problem. Heuristics are developed to maintain a priority queue in a distributed heap. The computing times and speedups for 25 random graphs obtained with up to 16 ring members are discussed.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
8. References
Finkel, R. and U. Manber, 1983, "DIB — A Distributed Implementation of Backtracking", Computer Science Technical Report #583, University of Wisconsin, Madison
Garey, M.R. and D.S. Johnson, 1979, "Computers and Intractability: A Guide to the Theory of NP-Completeness", Freeman, San Francisco, Calif.
Held, M. and R. Karp, 1971, "The Travelling Salesman Problem and Minimum Spanning Trees: Part II", Math. Prog. 1, pp. 6–25
Lai, T.-H. and S. Sahni, 1984, "Anomalies in Parallel Branch-and-Bound Algorithms", Communications of the ACM, Vol. 27, No. 6, pp. 594–602
Lawler, E.-L. and D.E. Wood, 1966, "Branch-and-Bound Methods: A survey", Operations Research 14, pp. 699–719
Li, G. and B.W. Wah, 1984, "Computational Efficiency of Parallel Approximate Branch-and-Bound Algorithms", Proc. of the 1984 International Conference on Parallel Processing, pp. 473–480
Mohan, J. 1983, "A study in Parallel Computations: the Travelling Saelsman Problem", Technical Report CMU-CS-82-136(R), Dept. of Computer Science, Carnegie-Mellon University, Pittsburgh
Monien, B., E. Speckenmeyer, O. Vornberger, 1986, "Superlinear Speedup for parallel Backtracking", submitted for publication
Monien, B., O. Vornberger, 1986, "The Ring Machine", submitted for publication
Vornberger, O., 1986, "Implementing Branch-and-Bound in a Ring of Processors", Technical Report Nr. 29, Dept. of Mathematics and Computer Science, University of Paderborn, W.-Germany
Wah, B.W. and Y.W. Eva Ma, 1984, "MANIP — A Multicomputer Architecture for Solving Combinatorial Extremum-Search Problems", IEEE Transactions on Computers, Vol. C-33, No. 5, pp. 377–390
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vornberger, O. (1986). Implementing branch-and-bound in a ring of processors. In: Händler, W., Haupt, D., Jeltsch, R., Juling, W., Lange, O. (eds) CONPAR 86. CONPAR 1986. Lecture Notes in Computer Science, vol 237. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16811-7_166
Download citation
DOI: https://doi.org/10.1007/3-540-16811-7_166
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16811-9
Online ISBN: 978-3-540-44856-3
eBook Packages: Springer Book Archive