Skip to main content
SpringerLink
Log in

Parallel Heuristic Search

  • Reference work entry
Encyclopedia of Optimization

  • 294 Accesses

Article Outline

Optimization -- Parallel Search Algorithms -- Heuristics

Task Partitioning

Parallel Window Search

Tree Partitioning

Stack Splitting

Search-Frontier Splitting

Work Distribution

Table Driven Search

See also

References

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 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Baudet G (1978) The design and analysis of algorithms for asynchronous multiprocessors. PhD Thesis, Dept Comput Sci, Carnegie-Mellon Univ, Pittsburgh

    Google Scholar 

  2. Dijkstra E, Feijen WHJ, van Gasteren AJM (1983) Derivation of a termination detection algorithm for distributed computation. Inform Process Lett 16:217–219

    Article  MathSciNet  Google Scholar 

  3. Hsu FH (1990) Large scale parallelization of Alpha-Beta search: An algorithmic and architectural study with computer chess. PhD Dissertation, Carnegie-Mellon Univ, Pittsburgh

    Google Scholar 

  4. Kumar V, Grama A, Gupta A, Karypis G (1994) Introduction to parallel computing. Benjamin Cummings, Harlow

    MATH  Google Scholar 

  5. Kumar V, Rao V (1990) Scalable parallel formulations of depth-first search. In: Kumar V, Gopalakrishnan PS, Kanal L (eds) Parallel Algorithms for Machine Intelligence and Vision. Springer, Berlin, pp 1–41

    Google Scholar 

  6. Lüling R, Monien B (1992) Load balancing for distributed branch & bound algorithms. Int Par Process Symp, IPPS 92. IEEE Comput Soc Press, pp 543–549

    Google Scholar 

  7. Powley C, Korf RE (1991) Single-agent parallel window search. IEEE Trans Pattern Anal Machine Intell PAMI 13(5):466–477

    Article  Google Scholar 

  8. Reinefeld A (1996) Parallel search in discrete optimization problems. J Simul Pract Theory 4:169–188

    Article  Google Scholar 

  9. Romein JW, Bal HE, Schaeffer J, Plaat A (2002) A performance analysis of transposition-table-driven work scheduling in distributed search. IEEE Trans Parallel Distrib Syst 13(5):447–459

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ZIB Berlin, Berlin, Germany

    Alexander Reinefeld

Authors
  1. Alexander Reinefeld
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Reinefeld, A. (2008). Parallel Heuristic Search . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_500

Download citation

Publish with us

Policies and ethics

Search

Navigation