A comparison between MPI and OpenMP branch-and-bound skeletons

Author

Dorta, Isabel ; León, Coromoto ; Rodríguez, Casiano

Author_Institution

Departamento de Estadistica, Univ. de La Laguna, Tenerife, Spain

fYear

2003

Abstract

This article describes and compares two parallel implementations of branch-and-bound skeletons. Using the C++ programming language, the user has to specify the type of the problem, the type of the solution and the specific characteristics of the branch-and-bound technique. This information is combined with the provided resolution skeletons to obtain a distributed and a shared parallel program. MPI has been used to develop the message passing algorithm and for the shared memory one OpenMP has been chosen. Computational results for the 0/1 knapsack problem on a Sunfire 6800 SMP, a Origin 3000 and a PCs cluster are presented.

Keywords

application program interfaces; knapsack problems; message passing; parallel programming; tree searching; 0/1 knapsack problem; C++ programming language; OpenMP branch-and-bound skeletons; message passing algorithm; shared parallel programs; Application software; Clustering algorithms; Computer languages; Concurrent computing; High performance computing; Libraries; Message passing; Parallel processing; Personal communication networks; Skeleton;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel and Distributed Processing Symposium, 2003. Proceedings. International

ISSN

1530-2075

Print_ISBN

0-7695-1926-1

Type

conf

DOI

10.1109/IPDPS.2003.1213254

Filename

1213254