Performance analysis of Branch-and-Bound skeletons

Authors:
I. Dorta;C. LeóN;C. RodríGuez
Affiliations:
Departamento de Estadística, I.O. y Computación, University of La Laguna, E-38271 La Laguna, Tenerife, Spain11http://nereida.deioc.ull.es;Departamento de Estadística, I.O. y Computación, University of La Laguna, E-38271 La Laguna, Tenerife, Spain11http://nereida.deioc.ull.es;Departamento de Estadística, I.O. y Computación, University of La Laguna, E-38271 La Laguna, Tenerife, Spain11http://nereida.deioc.ull.es
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
2010

Citing 3
Cited 0

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
MPI-The Complete Reference, Volume 1: The MPI Core

MPI-The Complete Reference, Volume 1: The MPI Core
Control Schemes in a Generalized Utility for Parallel Branch-and-Bound Algorithms

IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing

Quantified Score

Hi-index	0.98

Visualization

Abstract

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. call allows us to annotate the code by hand at the special points with a complexity function. Also, some computational results are presented.