Parallel processing of combinatorial search trees

  • B. Monien
  • O. Vornberger
Invited Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 269)


This paper describes the implementations of parallel algorithms on distributed systems in the department of mathematics and computer science at the University of Paderborn. We report on the design and analysis of multiprocessor systems used to solve combinatorial optimization problems from the area of operations research and artificial intelligence.


Search Tree Minimum Span Tree Travelling Salesman Problem Local Area Network Priority Queue 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7. References

  1. [1]
    S.G. Akl, D.T. Barnard, R. Doran: "Design, Analysis and Implementation of a Parallel Tree Search Algorithm", IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. PAMI-4, No. 2 (1982) pp. 192–203Google Scholar
  2. [2]
    G.M. Baudet: "The Design and Analysis of Algorithms for asynchronous Multiprocessors", Carnegie Mellon University, Technical Report #CMU-CS-78-116, 1978Google Scholar
  3. [3]
    M.S. Campbell, T.A. Marsland: "A Comparison of Minimax Tree Search Algorithms", Artificial Intelligence 20 (1983), pp. 347–367CrossRefGoogle Scholar
  4. [4]
    E. Felten, S. Karlin S.W. Otto: The Travelling Salesman Problem on a Hypercube, MIMD Computer", Proceedings of the Intern. Conf. on Parallel Processing, 1985, pp. 6–10Google Scholar
  5. [5]
    R.A. Finkel, J.P. Fishburn: "Parallelism in Alpha-Beta Search", Artificial Intelligence 19 (1982), pp. 89–106CrossRefGoogle Scholar
  6. [6]
    R.A. Finkel, J.P. Fishburn: "Improved Speedup Bounds for Parallel Alpha-Beta Search", IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. PAMI-5, No. 1, Jan. 1983, pp. 89–92Google Scholar
  7. [7]
    R. Finkel, U. Manber: "DIB — A Distributed Implementation of Backtracking", Technical Report #588, March 1985 Dept. of Computer Science, University of Wisconsin-MadisonGoogle Scholar
  8. [8]
    M.R. Garey, D.S. Johnson: "Computers and Intractability: A guide to the theory of NP-completeness (1979), Freeman, San Francisco, Calif.Google Scholar
  9. [9]
    M. Held, R. Karp: "The Travelling Salemann Problem and Minimum Spanning Trees: Part II" Math. Prog. 1(1971), pp.6–25CrossRefGoogle Scholar
  10. [10]
    D.E. Knuth, R.W. Moore: "An Analysis of Alpha-Beta Pruning", Artificial Intelligence 6 (1975), pp. 293–326CrossRefGoogle Scholar
  11. [11]
    V. Kumar, L.N. Kanal: "Parallel Branch-and-Bound Formulations for AND/OR Tree Search", IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. PAMI-6, No. 6, Nov. 1984, pp. 768–778Google Scholar
  12. [12]
    T.-H. Lai, S. Sahni: "Anomalies in Parallel Branch-and-Bound Algorithms", Communications of the ACM, Vol. 27, No. 6, June 1984, pp. 594–602CrossRefGoogle Scholar
  13. [13]
    T.-H. Lai, A. Sprague: "Performance of Parallel Branch-and-Bound Algorithms", Proc. of the 1985 Intern. Conf. on Parallel ProcessingGoogle Scholar
  14. [14]
    T.H. Lai, A. Sprague: "A Note on Anomalies in Parallel Branch-and-Bound Algorithms with one-to-one bounding functions", Information Processing Letters 23 (1986), pp. 119–122MathSciNetGoogle Scholar
  15. [15]
    T.A. Marsland, M. Campbell: "Parallel Search of Strongly Ordered Game Trees", Computing Surveys, Vol. 14, No. 4, Dec. 1982, pp. 533–553CrossRefGoogle Scholar
  16. [16]
    T.A. Marsland, F. Popowich: "Parallel Game-Trees Search", IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. PAMI-7, No. 4, July 1985, pp. 442–452Google Scholar
  17. [17]
    J. Mohan: "A Study in Parallel Computation: the Travelling Salesman Problem", Technical Report CMU-CS-82-136(R), (1983), Dept. of Computer Science, Carnegie-Mellon University, PittsburghGoogle Scholar
  18. [18]
    B. Monien, O. Vornberger: "The Ring Machine", Technical Report No. 27, Dec. 1985, Dept. of Computer Science, University of Paderborn, West-Germany, submitted to Computers & Artificial IntelligenceGoogle Scholar
  19. [19]
    B. Monien, E. Speckenmeyer, O. Vornberger: "Superlinear Speedup for Parallel Backtracking", Technical Report Nr. 30, July 1986, Dept. of Computer Science, University of Paderborn, West-Germany, submitted for publicationGoogle Scholar
  20. [20]
    M. Quinn, N. Deo: "An upper Bound for the Speedup of Parallel Branch-and-Bound Algorithms", Technical Report CS-83-112, May 1983, Computer Science Dept. Washington State UniversityGoogle Scholar
  21. [21]
    I. Roizen, J. Pearl: "A Minimax Algorithm Better than Alpha-Beta? Yes and No", Artificial Intelligence 21 (1983), pp. 199–220Google Scholar
  22. [22]
    G.C. Stockman: "A Minimax Algorithm better than Alpha-Beta?", Artificial Intelligence 12 (1979), pp. 179–196CrossRefGoogle Scholar
  23. [23]
    O. Vornberger: "Implementing Brancy-&-Bound in a Ring of Processors", Technical Report No. 29, Feb. 1986, Dept. of Mathematics & Computer Science, University of Paderborn, short version in: Proceedings of CONPAR 86, Conference on Algorithms and Hardware for Parallel Processing, Aachen 1986Google Scholar
  24. [24]
    O. Vornberger: "Parallel Computing on Personal Computers", Proceedings of the 1986 ACM SIGSMALL/PC Symposium on small systems, San Francisco, pp. 115–123Google Scholar
  25. [25]
    O. Vornberger, R. Feldmann, P. Mysliwietz: "A Local Area Network used as a Parallel Architecture", Technical Report No. 31, Sept. 86, Dept. of Mathematics & Computer Science, University of PaderbornGoogle Scholar
  26. [26]
    O. Vornberger: "The Personal Supercomputer: A Network of Transputers", Proceedings of the 2nd International Conference on Supercomputing, Santa Clara, USA, May 1987Google Scholar
  27. [27]
    B.W. Wah, G. Li, Ch.F. Yu: "Multiprocessing of Combinatorial Search Problems", Computer, June 1985, pp 93–108Google Scholar
  28. [28]
    B.W. Wah, Y.W.E. Ma: "MANIP — A Multicomputer Architecture for Solving Combinatorial Extremum-Search Problems", IEEE Transactions on Computers, Vol. C-33, No. 5, May 1984, pp. 377–390Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • B. Monien
    • 1
  • O. Vornberger
    • 1
  1. 1.Dept. of Mathematics and Computer ScienceUniversity of PaderbornGermany

Personalised recommendations