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.