Skip to main content
SpringerLink
Log in

Parallel processing of combinatorial search trees

  • Invited Papers
  • Conference paper
  • First Online:
Parallel Algorithms and Architectures

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 269))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7. References

  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–203

    Google Scholar 

  2. G.M. Baudet: "The Design and Analysis of Algorithms for asynchronous Multiprocessors", Carnegie Mellon University, Technical Report #CMU-CS-78-116, 1978

    Google Scholar 

  3. M.S. Campbell, T.A. Marsland: "A Comparison of Minimax Tree Search Algorithms", Artificial Intelligence 20 (1983), pp. 347–367

    Article  Google Scholar 

  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–10

    Google Scholar 

  5. R.A. Finkel, J.P. Fishburn: "Parallelism in Alpha-Beta Search", Artificial Intelligence 19 (1982), pp. 89–106

    Article  Google Scholar 

  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–92

    Google Scholar 

  7. R. Finkel, U. Manber: "DIB — A Distributed Implementation of Backtracking", Technical Report #588, March 1985 Dept. of Computer Science, University of Wisconsin-Madison

    Google Scholar 

  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. M. Held, R. Karp: "The Travelling Salemann Problem and Minimum Spanning Trees: Part II" Math. Prog. 1(1971), pp.6–25

    Article  Google Scholar 

  10. D.E. Knuth, R.W. Moore: "An Analysis of Alpha-Beta Pruning", Artificial Intelligence 6 (1975), pp. 293–326

    Article  Google Scholar 

  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–778

    Google Scholar 

  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–602

    Article  Google Scholar 

  13. T.-H. Lai, A. Sprague: "Performance of Parallel Branch-and-Bound Algorithms", Proc. of the 1985 Intern. Conf. on Parallel Processing

    Google Scholar 

  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–122

    MathSciNet  Google Scholar 

  15. T.A. Marsland, M. Campbell: "Parallel Search of Strongly Ordered Game Trees", Computing Surveys, Vol. 14, No. 4, Dec. 1982, pp. 533–553

    Article  Google Scholar 

  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–452

    Google Scholar 

  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, Pittsburgh

    Google Scholar 

  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 Intelligence

    Google Scholar 

  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 publication

    Google Scholar 

  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 University

    Google Scholar 

  21. I. Roizen, J. Pearl: "A Minimax Algorithm Better than Alpha-Beta? Yes and No", Artificial Intelligence 21 (1983), pp. 199–220

    Google Scholar 

  22. G.C. Stockman: "A Minimax Algorithm better than Alpha-Beta?", Artificial Intelligence 12 (1979), pp. 179–196

    Article  Google Scholar 

  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 1986

    Google Scholar 

  24. O. Vornberger: "Parallel Computing on Personal Computers", Proceedings of the 1986 ACM SIGSMALL/PC Symposium on small systems, San Francisco, pp. 115–123

    Google Scholar 

  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 Paderborn

    Google Scholar 

  26. O. Vornberger: "The Personal Supercomputer: A Network of Transputers", Proceedings of the 2nd International Conference on Supercomputing, Santa Clara, USA, May 1987

    Google Scholar 

  27. B.W. Wah, G. Li, Ch.F. Yu: "Multiprocessing of Combinatorial Search Problems", Computer, June 1985, pp 93–108

    Google Scholar 

  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–390

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Mathematics and Computer Science, University of Paderborn, Germany

    B. Monien & O. Vornberger

Authors
  1. B. Monien
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. O. Vornberger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andreas Albrecht Hermann Jung Kurt Mehlhorn

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Monien, B., Vornberger, O. (1987). Parallel processing of combinatorial search trees. In: Albrecht, A., Jung, H., Mehlhorn, K. (eds) Parallel Algorithms and Architectures. Lecture Notes in Computer Science, vol 269. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18099-0_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-18099-0_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18099-9

  • Online ISBN: 978-3-540-47760-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation