Parallel Branch-and-Bound Skeletons: Message Passing and Shared Memory Implementations

  • Isabel Dorta
  • Coromoto Leon
  • Casiano Rodriguez
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3019)

Abstract

The aim of this article is to describe the design and the implementation of skeletons for the Branch-and-Bound technique. The library developed provides sequential and parallel resolution patterns to solve optimization problems through this technique on a wide range of parallel computing platforms. To use the skeletons proposed to solve a particular problem, the skeleton filler has to specify the type of the problem, the type of the solution and the specific characteristics of this paradigm using the C++ programming language, and the user does not need to have any knowledge in parallelizations techniques. This paper describes the sequential and the parallel algorithms for message passing and shared memory platforms, and shows computational results for the 0-1 knapsack problem on an Origin 3000.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alba, E., Almeida, F., Blesa, M., Cotta, C., Díaz, M., Dorta, I., Gabarró, J., González, J., León, C., Moreno, L., Petit, J., Roda, J., Rojas, A., Xhafa, F.: MaLLBa: Towards a Combinatorial Optimization Library for Geographically Distributed Systems. Actas de las XII Jornadas de Paralelismo, 105–110 (2001)Google Scholar
  2. 2.
    Alba, E., Almeida, F., Blesa, M., Cabeza, J., Cotta, C., Díaz, M., Dorta, I., Gabarró, J., León, C., Luna, J., Moreno, L., Petit, J., Rojas, A., Xhafa, F.: MaLLBa: A Library of skeletons for combinatorial optimisation. In: Monien, B., Feldmann, R.L. (eds.) Euro-Par 2002. LNCS, vol. 2400, pp. 927–932. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  3. 3.
    Cole, M.: eSkel library home page, http://www.dcs.ed.ac.uk/home/mic/sKel (2002)
  4. 4.
    Eckstein, J., Phillips, C.A., Hart, W.E.: PICO: An Object-Oriented Framework for Parallel Branch and Bound, Rutcor Research Report (2000)Google Scholar
  5. 5.
    Ibaraki, T.: Enumerative Approaches to Combinatorial Optimization - Part I, Annals of Operations Research (10). Scientific, Basel, Switzerland (1987)Google Scholar
  6. 6.
    Kuchen, H.: A skeleton library. In: Monien, B., Feldmann, R.L. (eds.) Euro-Par 2002. LNCS, vol. 2400, pp. 620–629. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  7. 7.
    Le Cun, B., Roucairol, C., The PNN Team: BOB: a Unified Platform for Implementing Branch-and-Bound like Algorithms. Rapport de Recherche n. 95/16 (1999) Google Scholar
  8. 8.
    Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. John Wiley & Sons Ltd, Chichester (1990)MATHGoogle Scholar
  9. 9.
    OpenMP Architecture Review Board, OpenMP C and C++ Application Program Interface, Version 1.0, http://www.openmp.org (1998)
  10. 10.
    Ralphs, T.K., Ladány, L.: COIN-OR: Common Optimization Interface for Operations Research, COIN/BCP User’s Manual, International Business Machines Corporation Report (2001)Google Scholar
  11. 11.
    Snir, M., Otto, S.W., Huss-Lederman, S., Walker, D.W., Dongarra, J.J.: MPI: The Complete Reference. The MIT Press, Cambridge (1996)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Isabel Dorta
    • 1
  • Coromoto Leon
    • 1
  • Casiano Rodriguez
    • 1
  1. 1.Departamento de Estadistica, I.O. y ComputacionUniversidad de La LagunaLa LagunaSpain

Personalised recommendations