By Topic

Performance analysis of branch-and-bound skeletons

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
I. Dorta ; Dpto. de Estadistica, Univ. de La Laguna, Spain ; C. Leon ; C. Rodriguez

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

Published in:

14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP'06)

Date of Conference:

15-17 Feb. 2006