DocumentCode :
3503273
Title :
Performance analysis of branch-and-bound skeletons
Author :
Dorta, I. ; León, C. ; Rodríguez, C.
Author_Institution :
Dpto. de Estadistica, Univ. de La Laguna, Spain
fYear :
2006
fDate :
15-17 Feb. 2006
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 to annotate the code by hand at the special points with a complexity function. Also, some computational results are presented.
Keywords :
parallel algorithms; resource allocation; tree searching; CALL; PARAVER; branch-and-bound skeleton; communication pattern; complexity function; load balancing; performance analysis; Biology computing; Combinatorial mathematics; Computational biology; Computer science; Libraries; Load management; Operations research; Performance analysis; Programming profession; Skeleton;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel, Distributed, and Network-Based Processing, 2006. PDP 2006. 14th Euromicro International Conference on
ISSN :
1066-6192
Print_ISBN :
0-7695-2513-X
Type :
conf
DOI :
10.1109/PDP.2006.58
Filename :
1613256
Link To Document :
بازگشت