论文信息 - A comparison between MPI and OpenMP Branch-and-Bound Skeletons

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

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.

Coromoto León | Casiano Rodríguez | Isabel Dorta

[1] Jack Dongarra,et al. MPI: The Complete Reference , 1996 .

[2] Grant E. Haab,et al. Flexible control structures for parallelism in OpenMP , 2000, Concurr. Pract. Exp..

[3] Jonathan Schaeffer,et al. Generating parallel programs from the wavefront design pattern , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[4] Murray Cole,et al. Bringing skeletons out of the closet: a pragmatic manifesto for skeletal parallel programming , 2004, Parallel Comput..

[5] Herbert Kuchen,et al. A Skeleton Library , 2002, Euro-Par.

[6] Cynthia A. Phillips,et al. Pico: An Object-Oriented Framework for Parallel Branch and Bound * , 2001 .

[7] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[8] Mark Bull,et al. Development of mixed mode MPI / OpenMP applications , 2001, Sci. Program..

[9] Yuji Shinano,et al. A generalized utility for parallel branch and bound algorithms , 1995, Proceedings.Seventh IEEE Symposium on Parallel and Distributed Processing.

[10] Cynthia A. Phillips,et al. PICO: An Object-Oriented Framework for Branch and Bound , 2000 .