Performance analysis of Branch-and-Bound skeletons
This article proposes a study of load balancing and communication pattern for Branch-and-Bound algorithms. Concretely, sequential and parallel generic skeletons to implement this algorithmic technique are presented. To accomplish the work the CALL and PARAVER tools are used. c a l l allows us to annotate the code by hand at the special points with a complexity function. Also, some computational results are presented. (C) 2009 Elsevier Ltd. All rights reserved.
load balancing algorithmic skeletons branch-and-bound technique