TY  - CONF
AU  - Dorta, I.
AU  - León, C.
AU  - Rodríguez, C.
T1  - A comparison between MPI and OpenMP Branch-and-Bound skeletons
LA  - eng
PY  - 2003
SP  - 66
EP  - 73
T2  - Proceedings of the International Workshop on High-Level Programming Models and Supportive Environments, HIPS
SN  - 076951880X
VL  - 2003-January
PB  - IEEE Computer Society
AB  - 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.
DO  - 10.1109/HIPS.2003.1196496
UR  - https://portalciencia.ull.es/documentos/5e3adcdf299952629a024aa3
DP  - Dialnet - Portal de la Investigación
ER  -