A comparison between MPI and OpenMP Branch-and-Bound skeletons

Author

Dorta, Isabel ; Leon, Coromoto ; Rodríguez, Casiano

Author_Institution

Departamento de Estadistica, I.O. y Computacion, Univ. de La Laguna, Tenerife, Spain

fYear

2003

fDate

22-22 April 2003

Firstpage

66

Lastpage

73

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 programs. 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

C++ language; application program interfaces; message passing; parallel programming; shared memory systems; tree searching; C++ programming language; Knapsack Problem; MPI branch-and-bound skeletons; OpenMP branch-and-bound skeletons; Origin 3000; PCs cluster; Sunfire 6800 SMP; distributed parallel programs; resolution skeletons; 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

High-Level Parallel Programming Models andSupportive Environments, 2003. Proceedings. Eighth International Workshop on

Conference_Location

Nice, France

Print_ISBN

0-7695-1880-X

Type

conf

DOI

10.1109/HIPS.2003.1196496

Filename

1196496