Abstract
This work presents a parallel skeleton for the Branch and Bound technique. The main contribution of the proposed skeleton is that it is fully distributed. The implementation has been written in mpi. The user interface is the same as the one provided by the combinatorial optimization library MaLLBa. Computational results for a heterogeneous Linux cluster of PC are presented.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Dorta, I., León, C., Rodríguez, C., Rojas, A.: Parallel Skeletons for Divide-and-conquer and Branch-and-bound Techniques. In: 11th Euromicro Conference on Parallel, Distributed and Network-based Processing, Geneva, Italy, pp. 292–298. IEEE Computer Society Press, Los Alamitos (2003)
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)
Di Martino, B., Mazzocca, N., Russo, S.: Paradigms for the Parallelization of Branch and Bound Algorithms. In: Waśniewski, J., Madsen, K., Dongarra, J. (eds.) PARA 1995. LNCS, vol. 1041, pp. 141–150. Springer, Heidelberg (1996)
Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. John Wiley & Sons, Chichester (1990)
OpenMP Architecture Review Board, OpenMP C and C++ Application Program Interface, Version 1.0 (1998), http://www.openmp.org
Shah, S., Haab, G., Petersen, P., Throop, J.: Flexible Control Structures for Parallelism in OpenMP. In: 1st European Workshop on OpenMP, Lund, Sweden (September 1999)
Shinano, Y., Higaki, M., Hirabayashi, R.: A Generalized Utility for Parallel Branch and Bound Algorithms, pp. 392–401. IEEE Computer Society Press, Los Alamitos (1995)
Snir, M., Otto, S.W., Huss-Lederman, S., Walker, D.W., Dongarra, J.J.: MPI: The Complete Reference. MIT Press, Cambridge (1996)
Supercomputing Technologies Group, Cilk-5.3 Reference Manual (June 2000), http://supertech.lcs.mit.edu/cilk
Tschöke, S., Polzer, T.: Portable Parallel Branch-and-Bound Library, User Manual Library Version 2.0, Paderborn (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
González, J.R., León, C., Rodríguez, C. (2004). An Asynchronous Branch and Bound Skeleton for Heterogeneous Clusters. In: Kranzlmüller, D., Kacsuk, P., Dongarra, J. (eds) Recent Advances in Parallel Virtual Machine and Message Passing Interface. EuroPVM/MPI 2004. Lecture Notes in Computer Science, vol 3241. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30218-6_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-30218-6_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23163-9
Online ISBN: 978-3-540-30218-6
eBook Packages: Springer Book Archive