Skip to main content
SpringerLink
Log in

An OpenMP Skeleton for the A* Heuristic Search

  • Conference paper
High Performance Computing and Communications (HPCC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3726))

Abstract

This work presents a skeleton for the A* heuristic search. This skeleton provides to the user a sequential solver and a parallel solver based in the shared memory paradigm. The user interface for the specification of the necessary classes and methods to solve an specific problem is described. Also the internal operation mode of the two solvers is showed in detail. Computational results obtained on a multiprocessor machine for the Two-Dimensional Cutting Stock Problem are presented.

This work has been supported by the ec (feder) and by the Spanish Ministry of Science and Technology with contract number tic2002-04498-c05-05. Also by the Canary Government Project cof2003/022. The work of G. Miranda has been developed under the grant fpu-ap2004-2290.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Aguilar, M., Hirsbrunner, B.: Pact: An Environment for Parallel Heuristic Programming. In: International Conference Massivelly Parallel Processing: Application and Development, Delft, The Netherlands, June 21-23 (1994)

    Google Scholar 

  2. Dyckhoff, H.: A Typology of Cutting and Packing Problems. European Journal of Operational Research 44, 145–159 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  3. Hifi, M.: Improvement of Viswanathan and Bagchi’s Exact Algorithm for Constrained Two-Dimensional Cutting Stock. Computer Operations Research 24, 727–736 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  4. Miranda, G., Len, C., Rodríguez, C.: Implementación del Problema de Corte Bidimensional con la Librería MALLBA. In: Actas de las XV Jornadas de Paralelismo, Almería, Spain, pp. 96–101 (2004)

    Google Scholar 

  5. Miranda, G., León, C.: Esqueletos para Algoritmos A*, Dpto. de Estadística, I.O. y Computación, Universidad de La Laguna, DT-DEIOC-04-06 (2004)

    Google Scholar 

  6. OpenMP Architecture Review Board, OpenMP C and C++ Application Program Interface, Version 1.0 (1998), http://www.openmp.org

  7. Sweeney, P.E., Paternoster, E.R.: Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography. Journal of the Operational Research Society 43, 691–706 (1992)

    MATH  Google Scholar 

  8. Viswanathan, K.V., Bagchi, A.: Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems. Operations Research 41, 768–776 (1993)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dpto. de Estadística, I.O. y Computación, Universidad de La Laguna, E-38271, La Laguna, Canary Islands, Spain

    G. Miranda & C. León

Authors
  1. G. Miranda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. León
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, St. Francis Xavier University, Antigonish, Canada

    Laurence T. Yang

  2. School of Computer Science/Welsh eScience Centre, Cardiff University, UK

    Omer F. Rana

  3. Dipartimento di Ingegneria dell’ Informazione - Second, University of Naples - Italy, Real Casa dell’Annunziata - via Roma, 29 81031, Aversa (CE), Italy

    Beniamino Di Martino

  4. Computer Science Department, University of Tennessee, 37996-3450, Knoxville, TN, USA

    Jack Dongarra

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Miranda, G., León, C. (2005). An OpenMP Skeleton for the A* Heuristic Search. In: Yang, L.T., Rana, O.F., Di Martino, B., Dongarra, J. (eds) High Performance Computing and Communications. HPCC 2005. Lecture Notes in Computer Science, vol 3726. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11557654_82

Download citation

  • DOI: https://doi.org/10.1007/11557654_82

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29031-5

  • Online ISBN: 978-3-540-32079-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation