Skip to main content
SpringerLink
Log in

Parallel search algorithms for discrete optimization problems

  • Invited Presentations
  • Conference paper
  • First Online:
System Modelling and Optimization

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 197))

Abstract

Discrete optimization problems (DOPs) arise in various applications such as planning, scheduling, computer aided design, robotics, game playing, and constraint directed reasoning. Often, a DOP is formulated in terms of finding a minimum cost solution path in a graph from an initial node to a goal node. It is solved using graph/tree search methods such as backtracking, branch-and-bound, heuristic search, and dynamic programming. Availability of parallel computers has created substantial interest in exploring the use of parallel processing for solving discrete optimization problems. This article provides an overview of our work on parallel search algorithms.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. P. Agrawal, V. K. Janakiram, and Ram Mehrotra. A randomized parallel branch and bound algorithm. In Proceedings of International conference on Parallel Processing, 1988.

    Google Scholar 

  2. S. Arvindam, Vipin Kumar, and V. Nageshwara Rao. Floorplan optimization on multiprocessors. In Proceedings of the 1989 International Conference on Computer Design (ICCD-89), 1989. Also published as MCC Technical Report ACT-OODS-241-89.

    Google Scholar 

  3. S. Arvindam, Vipin Kumar, and V. Nageshwara Rao. Efficient parallel algorithms for search problems: Applications in vlsi cad. In Proceedings of the Frontiers 90 Conference on Massively Parallel Computation, October 1990.

    Google Scholar 

  4. S. Arvindam, Vipin Kumar, V. Nageshwara Rao, and Vineet Singh. Automatic test pattern generation on multiprocessors. Parallel Computing, 17, number 12:1323–1342, December 1991.

    Article  Google Scholar 

  5. D. J. Challou, M. Gini, and V. Kumar. Parallel search algorithms for robot motion planning. Technical Report CS-TR 92-65, University of Minnesota, Minneapolis, MN, 1992. Also appears in the working notes of the 1993 AAAI Spring Symposium on Innovative Applications of Massive Parallelism.

    Google Scholar 

  6. R. Dehne, A. Ferreira, and A. Rau-Chaplin. A massively parallel knowledge-base server using a hypercube multiprocessor. Technical report, Carleton University, SCS-TR-170, April 1990.

    Google Scholar 

  7. M. Evett, James Hendler, Ambujashka Mahanti, and Dana Nau. Pra*: A memory-limited heuristic search procedure for the connection machine. In Proceedings of the third symposium on the Frontiers of Massively Parallel Computation, pages 145–149, 1990.

    Google Scholar 

  8. Chris Ferguson and Richard Korf. Distributed tree search and its application to alpha-beta pruning. In Proceedings of the 1988 National Conference on Artificial Intelligence, August 1988.

    Google Scholar 

  9. R. A. Finkel and J. P. Fishburn. Parallelism in alpha-beta search. Artificial Intelligence, 19:89–106, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  10. Raphael A. Finkel and Udi Manber. DIB — a distributed implementation of backtracking. ACM Transactions of Programming Languages and Systems, 9 No. 2:235–256, April 1987.

    Article  Google Scholar 

  11. M. Furuichi, K. Taki, and N. Ichiyoshi. A multi-level load balancing scheme for or-parallel exhaustive search programs on the multi-psi. In Proceedings of the 2nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 1990. pp.50–59.

    Google Scholar 

  12. M. Garey and D. S. Johnson. Computers and Intractability. Freeman, San Francisco, 1979.

    MATH  Google Scholar 

  13. Ananth Grama, Anshul Gupta, and Vipin Kumar. Isoefficiency function: A scalability metric for parallel algor ithms and architectures. IEEE Parallel and Distributed Technology, Special Issue on Parallel and Distributed Systems: From Theory to Practice, 1993 (To be Published). Also available as Technical Report TR-93-24, Department of Computer Science, University of Minnesota and from anonymous ftp site ftp.cs.umn.edu (128.101.225.7), file users/kumar/isoeff-tutorial.ps.

    Google Scholar 

  14. Ananth Grama, Vipin Kumar, and V. Nageshwara Rao. Experimental evaluation of load balancing techniques for the hypercube. In Proceedings of the Parallel Computing 91 Conference, 1991.

    Google Scholar 

  15. Ananth Y. Grama, V. Kumar, and P. Pardalos. Parallel processing of discrete optimization problems. In Encyclopaedia of Microcomputers. Marcel Dekker Inc., New York, 1992.

    Google Scholar 

  16. Ananth Y. Grama and Vipin Kumar. A survey of parallel search algorithms for discrete optimization problems. Technical report, TR-93-11, Department of Computer Science, University of Minnesota, Minneapolis, 1993. Also available from anonymous ftp site ftp.cs.umn.edu (128.101.225.7), file users/kumar/survey_discrete_opt.ps.

    Google Scholar 

  17. Ellis Horowitz and Sartaj Sahni. Fundamentals of Computer Algorithms. Computer Science Press, Rockville, Maryland, 1978.

    MATH  Google Scholar 

  18. M. Imai, Y. Yoshida, and T. Fukumura. A parallel searching scheme for multiprocessor systems and its application to combinatorial problems. In IJCAI, pages 416–418, 1979.

    Google Scholar 

  19. Laveen Kanal and Vipin Kumar. Search in Artificial Intelligence. Springer-Verlag, New York, 1988.

    Book  MATH  Google Scholar 

  20. George Karypis and Vipin Kumar. Unstructured Tree Search on SIMD Parallel Computers. Technical Report 92-21, Computer Science Department, University of Minnesota, 1992. A short version of this paper appears in the Proceedings of Supercomputing 1992 Conference, November 1992.

    Google Scholar 

  21. V. Kumar, P. S. Gopalkrishnan, and L. Kanal (editors). Parallel Algorithms for Machine Intelligence and Vision. Springer Verlag, New York, 1990.

    Google Scholar 

  22. V. Kumar and L. Kanal. Parallel branch-and-bound formulations for and/or tree search. IEEE Transactions Pattern Analysis and Machine Intelligence, PAMI-6:768–778, 1984.

    Article  Google Scholar 

  23. Vipin Kumar. Depth-first search. In Stuart C. Shapiro, editor, Encyclopaedia of Artificial Intelligence: Vol 2, pages 1004–1005. John Wiley and Sons, Inc., New York, 1987.

    Google Scholar 

  24. Vipin Kumar, Ananth Grama, and V. Nageshwara Rao. Scalable load balancing techniques for parallel computers. Technical report, Technical Report 91-55, Computer Science Department, University of Minnesota, 1991. To appear in Jornal of Distributed and Parallel Computing, 1993.

    Google Scholar 

  25. Vipin Kumar, Ananth Y. Grama, Anshul Gupta, and George Karypis. Introduction to Parallel Computing: Algorithm Design and Analysis. Benjamin/Cummings, 1994.

    Google Scholar 

  26. Vipin Kumar and Anshul Gupta. Analyzing the scalability of parallel algorithms and architectures: A survey. In Proceedings of the 1991 International Conference on Supercomputing, June 1991. also appear as an invited paper in the Proceedings of 29th Annual Allerton Conference on Communication, Control and Computing, Urbana, IL, October 1991.

    Google Scholar 

  27. Vipin Kumar and Laveen Kanal. The cdp: A unifying formulation for heuristic search, dynamic programming, and branch-and-bound. In Laveen Kanal and Vipin Kumar, editors, Search in Artificial Intelligence. Springer-Verlag, New York, 1988.

    Google Scholar 

  28. Vipin Kumar, K. Ramesh, and V. Nageshwara Rao. Parallel best-first search of state-space graphs: A summary of results. In Proceedings of the 1988 National Conference on Artificial Intelligence, pages 122–126, August 1988.

    Google Scholar 

  29. Vipin Kumar and V. N. Rao. Scalable parallel formulations of depth-first search. In Vipin Kumar, P. S. Gopalakrishnan, and Laveen Kanal, editors, Parallel Algorithms for Machine Intelligence and Vision. Springer-Verlag, New York, 1990.

    Chapter  Google Scholar 

  30. Vipin Kumar and V. Nageshwara Rao. Parallel depth-first search, part II: Analysis. International Journal of Parallel Programming, 16 (6):501–519, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  31. T. H. Lai and Sartaj Sahni. Anomalies in parallel branch and bound algorithms. Communications of the ACM, pages 594–602, 1984.

    Google Scholar 

  32. E. L. Lawler and D. Woods. Branch-and-bound methods: A survey. Operations Research, 14, 1966.

    Google Scholar 

  33. Guo-Jie Li and Benjamin W. Wah. Coping with anomalies in parallel branch-and-bound algorithms. IEEE Transactions on Computers, C-35, June 1986.

    Google Scholar 

  34. G. Manzini and M. Somalvico. Probabilistic performance analysis of heuristic search using parallel hash tables. In Proceedings of the International Symposium on Artificial Intelligence and Mathematics, Ft. Lauderdale, FL, JAnuary, 1990.

    Google Scholar 

  35. B. Monien and O. Vornberger. Parallel processing of combinatorial search trees. In Proceedings of International Workshop on Parallel Algorithms and Architectures, May 1987.

    Google Scholar 

  36. B. Monien, O. Vornberger, and E. Spekenmeyer. Superlinear speedup for parallel back-tracking. Technical Report 30, University of Paderborn, FRG, 1986.

    Google Scholar 

  37. Judea Pearl. Heuristics-Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, Reading, MA, 1984.

    Google Scholar 

  38. Curt Powley, Chris Ferguson, and Richard Korf. Parallel heuristic search: Two approaches. In Vipin Kumar, P. S. Gopalakrishnan, and Laveen Kanal, editors, Parallel Algorithms for Machine Intelligence and Vision. Springer-Verlag, New York, 1990.

    Google Scholar 

  39. Abhiram Ranade. Optimal speedup for backtrack search on a butterfly network. In Proceedings of the Third ACM Symposium on Parallel Algorithms and Architectures, 1991.

    Google Scholar 

  40. V. Nageshwara Rao and V. Kumar. Parallel depth-first search, part I: Implementation. International Journal of Parallel Programming, 16 (6):479–499, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  41. V. Nageshwara Rao and V. Kumar. Concurrent access of priority queues. IEEE Transactions on Computers, C-37 (12), 1988.

    Google Scholar 

  42. V. Nageshwara Rao, V. Kumar, and K. Ramesh. A parallel implementation of iterativedeepening-a*. In Proceedings of the National Conference on Artificial Intelligence (AAAI-87), pages 878–882, 1987.

    Google Scholar 

  43. V. Nageshwara Rao and Vipin Kumar. On the efficiency of parallel backtracking. IEEE Transactions on Parallel and Distributed Systems, 4(4):427–437, April 1993. available as a technical report TR 90-55, Computer Science Department, University of Minnesota.

    Article  Google Scholar 

  44. V. Nageshwara Rao and Vipin Kumar. Superlinear speedup in state-space search. In Proceedings of the 1988 Foundation of Software Technology and Theoretical Computer Science, December 1988. Lecture Notes in Computer Science number 338, Springer Verlag.

    Google Scholar 

  45. V. Nageshwara Rao and Vipin Kumar. On the efficiency of parallel ordered depth-first search. In Proceedings of the 1991 Conference on Distributed Memory and Concurrent Computers, May 1991.

    Google Scholar 

  46. Vikram Saletore and L. V. Kale. Consistent linear speedup to a first solution in parallel state-space search. In Proceedings of the 1990 National Conference on Artificial Intelligence, pages 227–233, August 1990.

    Google Scholar 

  47. Wei Shu and L. V. Kale. A dynamic scheduling strategy for the chare-kernel system. In Proceedings of Supercomputing Conference, pages 389–398, 1989.

    Google Scholar 

  48. Douglas R. Smith. Random trees and the analysis of branch and bound proceedures. Journal of the ACM, 31 No. 1, 1984.

    Google Scholar 

  49. H. Stone and P. Sipala. The average complexity of depth-first search with backtracking and cutoff. IBM Journal of Research and Development, May 1986.

    Google Scholar 

  50. Peter Tinker. Performance and pragmatics of an OR-parallel logic programming system. International Journal of Parallel Programming, 1988.

    Google Scholar 

  51. Benjamin W. Wah, Guo jie Li, and Chee Fen Yu. Multiprocessing of combinatorial search problems. IEEE Computer, pages 93–108, June, 1985.

    Google Scholar 

  52. Benjamin W. Wah, G. J. Li, and C. F. Yu. Multiprocessing of combinatorial search problems. In Vipin Kumar, P. S. Gopalakrishnan, and Laveen Kanal, editors, Parallel Algorithms for Machine Intelligence and Vision. Springer-Verlag, New York, 1990.

    Google Scholar 

  53. Benjamin W. Wah and Y. W. Eva Ma. Manip — a multicomputer architecture for solving combinatorial extremum-search problems. IEEE Transactions on Computers, c-33, May 1984.

    Google Scholar 

  54. Benjamin W. Wah and C. F. Yu. Stochastic modelling of branch-and-bound algorithms with best-first search. IEEE Transactions on Software Engineering, SE-11, September 1985.

    Google Scholar 

  55. Herbert S. Wilf. Algorithms and Complexity. Prentice-Hall, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Minnesota, 55455, Minneapolis, MN

    V. Kumar & Ananth Y. Grama

Authors
  1. V. Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ananth Y. Grama
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jacques Henry Jean-Pierre Yvon

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag

About this paper

Cite this paper

Kumar, V., Grama, A.Y. (1994). Parallel search algorithms for discrete optimization problems. In: Henry, J., Yvon, JP. (eds) System Modelling and Optimization. Lecture Notes in Control and Information Sciences, vol 197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035459

Download citation

  • DOI: https://doi.org/10.1007/BFb0035459

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19893-2

  • Online ISBN: 978-3-540-39337-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation