Analysis of scalable parallel evolutionary algorithms

Jun HE; Xin YAO

doi:10.1109/CEC.2006.1688298

Analysis of scalable parallel evolutionary algorithms

Research output: Book Chapters | Papers in Conference Proceedings › Conference paper (refereed) › Research › peer-review

9 Citations (Scopus)

Abstract

Inherent parallelism is regarded as one of the most important advantages of evolutionary algorithms. This paper aims at makin g an initial study on the speedup of scalable parallel evolutionary algorithms. First the scalable parallel evolutionary algo rithms are described; then the speedup of such scalable algorithms is defined based on the first hitting time; Using the new definition, the relationship between population diversity and superlinear speedup is analyzed; finally a case study demonstra tes how population diversity plays a crucial role in generating the superlinear speedup. © 2006 IEEE.

Original language	English
Title of host publication	2006 IEEE Congress on Evolutionary Computation, CEC 2006
Publisher	IEEE
Pages	120-127
Number of pages	8
ISBN (Print)	9780780394872
DOIs	https://doi.org/10.1109/CEC.2006.1688298
Publication status	Published - 2006
Externally published	Yes

Access to Document

10.1109/CEC.2006.1688298

Cite this

@inproceedings{95300d0d7beb4c26be41248f0583f04f,

title = "Analysis of scalable parallel evolutionary algorithms",

abstract = "Inherent parallelism is regarded as one of the most important advantages of evolutionary algorithms. This paper aims at makin g an initial study on the speedup of scalable parallel evolutionary algorithms. First the scalable parallel evolutionary algo rithms are described; then the speedup of such scalable algorithms is defined based on the first hitting time; Using the new definition, the relationship between population diversity and superlinear speedup is analyzed; finally a case study demonstra tes how population diversity plays a crucial role in generating the superlinear speedup. {\textcopyright} 2006 IEEE.",

author = "Jun HE and Xin YAO",

year = "2006",

doi = "10.1109/CEC.2006.1688298",

language = "English",

isbn = "9780780394872",

pages = "120--127",

booktitle = "2006 IEEE Congress on Evolutionary Computation, CEC 2006",

publisher = "IEEE",

}

TY - GEN

T1 - Analysis of scalable parallel evolutionary algorithms

AU - HE, Jun

AU - YAO, Xin

PY - 2006

Y1 - 2006

N2 - Inherent parallelism is regarded as one of the most important advantages of evolutionary algorithms. This paper aims at makin g an initial study on the speedup of scalable parallel evolutionary algorithms. First the scalable parallel evolutionary algo rithms are described; then the speedup of such scalable algorithms is defined based on the first hitting time; Using the new definition, the relationship between population diversity and superlinear speedup is analyzed; finally a case study demonstra tes how population diversity plays a crucial role in generating the superlinear speedup. © 2006 IEEE.

AB - Inherent parallelism is regarded as one of the most important advantages of evolutionary algorithms. This paper aims at makin g an initial study on the speedup of scalable parallel evolutionary algorithms. First the scalable parallel evolutionary algo rithms are described; then the speedup of such scalable algorithms is defined based on the first hitting time; Using the new definition, the relationship between population diversity and superlinear speedup is analyzed; finally a case study demonstra tes how population diversity plays a crucial role in generating the superlinear speedup. © 2006 IEEE.

UR - http://www.scopus.com/inward/record.url?scp=34547374334&partnerID=8YFLogxK

U2 - 10.1109/CEC.2006.1688298

DO - 10.1109/CEC.2006.1688298

M3 - Conference paper (refereed)

SN - 9780780394872

SP - 120

EP - 127

BT - 2006 IEEE Congress on Evolutionary Computation, CEC 2006

PB - IEEE

ER -

Analysis of scalable parallel evolutionary algorithms

Abstract

Access to Document

Other files and links

Fingerprint

Cite this