loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing
Parallel Skeletons for Divide-and-Conquer and Branch-and-Bound techniques
Genova, Italy
February 05-February 07
ISBN: 0-7695-1875-3
Isabel Dorta, Universidad de La Laguna
Coromoto León, Universidad de La Laguna
Casiano Rodríguez, Universidad de La Laguna
Angélica Rojas, Universidad de La Laguna
This article describes the parallel implementation of skeletons for the Divide-and-Conquer and Branch-and- Bound techniques. The user has to choose a paradigm and has to specify for it the type of the problem, the type of the solution and the specific characteristics of the technique using the C++ programming language. This information is combined with the provided resolution skeleton to obtain a sequential program and a parallel program. The paper describes the parallel implementation of the skeletons using MPI. Computational results on a Linux-cluster of PCs, Cray T3E and Origin 3000 are resented.
Citation:
Isabel Dorta, Coromoto León, Casiano Rodríguez, Angélica Rojas, "Parallel Skeletons for Divide-and-Conquer and Branch-and-Bound techniques," pdp, pp.292, Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2003
Usage of this product signifies your acceptance of the Terms of Use.