loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
International Parallel and Distributed Processing Symposium (IPDPS'03)
A Comparison between MPI and OpenMP Branch-and-Bound Skeletons
Nice, France
April 22-April 26
ISBN: 0-7695-1926-1
ASCII Text
x 
 
Isabel Dorta, Coromoto León, Casiano Rodríguez, "A Comparison between MPI and OpenMP Branch-and-Bound Skeletons," Parallel and Distributed Processing Symposium, International, pp. 131a, International Parallel and Distributed Processing Symposium (IPDPS'03), 2003.
 
 
BibTex
x
 
@article{ 10.1109/IPDPS.2003.1213254,
author = {Isabel Dorta and Coromoto León and Casiano Rodríguez},
title = {A Comparison between MPI and OpenMP Branch-and-Bound Skeletons},
journal ={Parallel and Distributed Processing Symposium, International},
volume = {0},
year = {2003},
issn = {1530-2075},
pages = {131a},
doi = {http://doi.ieeecomputersociety.org/10.1109/IPDPS.2003.1213254},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel and Distributed Processing Symposium, International
TI - A Comparison between MPI and OpenMP Branch-and-Bound Skeletons
SN - 1530-2075
SP
EP
A1 - Isabel Dorta,
A1 - Coromoto León,
A1 - Casiano Rodríguez,
PY - 2003
KW - Skeletons
KW - Branch and Bound
KW - MPI
KW - OpenMP
VL - 0
JA - Parallel and Distributed Processing Symposium, International
ER -
 
Isabel Dorta, Universidad de La Laguna
Coromoto León, Universidad de La Laguna
Casiano Rodríguez, Universidad de La Laguna
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.
Index Terms:
Skeletons, Branch and Bound, MPI, OpenMP
Citation:
Isabel Dorta, Coromoto León, Casiano Rodríguez, "A Comparison between MPI and OpenMP Branch-and-Bound Skeletons," ipdps, pp.131a, International Parallel and Distributed Processing Symposium (IPDPS'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.