Parallel skeletons for divide-and-conquer and branch-and-bound techniques

Author

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

Author_Institution

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

fYear

2003

fDate

5-7 Feb. 2003

Firstpage

292

Lastpage

298

Abstract

The 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 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 presented.

Keywords

C++ language; divide and conquer methods; object-oriented programming; parallel programming; tree searching; C++ programming language; Cray T3E; Linux-cluster; MPI; Origin 3000; branch-and-bound techniques; divide-and-conquer techniques; object oriented skeletons; parallel implementation; parallel program; parallel skeletons; resolution skeleton; sequential program; Acceleration; Algorithm design and analysis; Application software; Computer languages; Concurrent computing; Dynamic programming; Libraries; Personal communication networks; Skeleton; Software tools;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel, Distributed and Network-Based Processing, 2003. Proceedings. Eleventh Euromicro Conference on

Conference_Location

Genova, Italy

ISSN

1066-6192

Print_ISBN

0-7695-1875-3

Type

conf

DOI

10.1109/EMPDP.2003.1183602

Filename

1183602