An Asynchronous Branch and Bound Skeleton for Heterogeneous Clusters

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.

[1]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[2]  D J Evans,et al.  Parallel processing , 1986 .

[3]  Jack Dongarra,et al.  MPI: The Complete Reference , 1996 .

[4]  Enrique Alba,et al.  MALLBA: A Library of Skeletons for Combinatorial Optimisation (Research Note) , 2002, Euro-Par.

[5]  Grant E. Haab,et al.  Flexible control structures for parallelism in OpenMP , 2000, Concurr. Pract. Exp..

[6]  Yuji Shinano,et al.  A generalized utility for parallel branch and bound algorithms , 1995, Proceedings.Seventh IEEE Symposium on Parallel and Distributed Processing.

[7]  Stefano Russo,et al.  Paradigms for the Parallelization of Branch and Bound Algorithms , 1995, PARA.

[8]  Coromoto León,et al.  Parallel skeletons for divide-and-conquer and branch-and-bound techniques , 2003, Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2003. Proceedings..