A parallel algorithm for global optimization problems in a distributed computing environment

GAVIANO, MARCO;LERA, DANIELA;
2012-01-01

Abstract

The problem of finding a global minimum of a real function on a set S of Rn occurs in many real world problems. Since its computational complexity is exponential, its solution can be a very expensive computational task. In this paper, we introduce a parallel algorithm that exploits the latest computers in the market equipped with more than one processor, and used in clusters of computers. The algorithm belongs to the improvement of local minima algorithm family, and carries on local minimum searches iteratively but trying not to find an already found local optimizer. Numerical experiments have been carried out on two computers equipped with four and six processors; fourteen configurations of the computing resources have been investigated. To evaluate the algorithm performances the speedup and the efficiency are reported for each configuration.
2012
Inglese
3
10A
1380
1387
8
Esperti anonimi
internazionale
scientifica
Random search; Global optimization; Parallel computing
no
Gaviano, Marco; Lera, Daniela; Mereu, E.
1.1 Articolo in rivista
info:eu-repo/semantics/article
1 Contributo su Rivista::1.1 Articolo in rivista
262
3
open
Files in This Item:
File Size Format  
articoloAM.pdf

open access

Type: versione editoriale
Size 235.29 kB
Format Adobe PDF
235.29 kB Adobe PDF View/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Questionnaire and social

Share on:
Impostazioni cookie