OpenMP skeletons for tree searches

Author

Miranda, G. ; León, C.

Author_Institution

Departamento de Estadistica, Univ. de La Laguna, Spain

fYear

2006

fDate

15-17 Feb. 2006

Abstract

This work presents a skeleton for the resolution of optimization problems using general tree search techniques. This skeleton provides to the user a sequential solver and a parallel solver based on the shared memory paradigm. The user interface for the specification of the necessary classes and methods is described. Also the internal operation mode of the two solvers and all the possible configurations of them are showed in detail. Computational results obtained on an Origin 3800 and on a multiprocessor machine for the two-dimensional cutting stock problem and for the error correcting code problem are presented.

Keywords

bin packing; error correction codes; optimisation; shared memory systems; tree searching; OpenMP skeletons; error correcting code problem; general tree search techniques; internal operation mode; multiprocessor machine; optimization problems; parallel solver; sequential solver; shared memory paradigm; tree searches; two-dimensional cutting stock problem; user interface; Algorithm design and analysis; Cost function; Electronic mail; Error correction codes; Government; Skeleton; Space technology; State-space methods; User interfaces;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel, Distributed, and Network-Based Processing, 2006. PDP 2006. 14th Euromicro International Conference on

ISSN

1066-6192

Print_ISBN

0-7695-2513-X

Type

conf

DOI

10.1109/PDP.2006.52

Filename

1613304