Author(s)

Marco Gaviano, Daniela Lera, Elisabetta Mereu

Department of Mathematics and Informatics, University of Cagliari, Cagliari, Italy.

The problem of finding a global minimum of a real function on a set S 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.

Random Search; Global Optimization; Parallel Computing

M. Gaviano, D. Lera and E. Mereu, "A Parallel Algorithm for Global Optimization Problems in a Distribuited Computing Environment," Applied Mathematics, Vol. 3 No. 10A, 2012, pp. 1380-1387. doi: 10.4236/am.2012.330194.