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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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)
Dyckhoff, H.: A Typology of Cutting and Packing Problems. European Journal of Operational Research 44, 145–159 (1990)
Hifi, M.: Improvement of Viswanathan and Bagchi’s Exact Algorithm for Constrained Two-Dimensional Cutting Stock. Computer Operations Research 24, 727–736 (1997)
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)
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)
OpenMP Architecture Review Board, OpenMP C and C++ Application Program Interface, Version 1.0 (1998), http://www.openmp.org
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)
Viswanathan, K.V., Bagchi, A.: Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems. Operations Research 41, 768–776 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)