Log(lambda) Modifications for Optimal Parallelism - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

Log(lambda) Modifications for Optimal Parallelism

(1, 2) , (1, 2)
1
2

Abstract

It is usually considered that evolutionary algorithms are highly parallel. In fact, the theoretical speed-ups for parallel optimization are far better than empirical results; this suggests that evolutionary algorithms, for large numbers of processors, are not so efficient. In this paper, we show that in many cases automatic parallelization provably provides better results than the standard parallelization consisting of simply increasing the population size lambda. A corollary of these results is that logarithmic bounds on the speed-up (as a function of the number of computing units) are tight within constant factors. Importantly, we propose a simple modification, termed log(lambda)-correction, which strongly improves several important algorithms when lambda is large.
Fichier principal
Vignette du fichier
autoparacnf.pdf (176.21 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00495087 , version 1 (25-06-2010)

Identifiers

  • HAL Id : inria-00495087 , version 1

Cite

Fabien Teytaud, Olivier Teytaud. Log(lambda) Modifications for Optimal Parallelism. Parallel Problem Solving From Nature, Sep 2010, Krakow, Poland. ⟨inria-00495087⟩
136 View
160 Download

Share

Gmail Facebook Twitter LinkedIn More