Skip to main content
SpringerLink
Log in

General Scheme for Analyzing Running Times of Parallel Evolutionary Algorithms

  • Conference paper
Parallel Problem Solving from Nature, PPSN XI (PPSN 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6238))

Included in the following conference series:

Abstract

We present new methods for the running time analysis of parallel evolutionary algorithms with spatially structured populations. These methods are applied to estimate the speed-up gained by parallelization in pseudo-Boolean optimization. The possible speed-up increases with the density of the topology. Surprisingly, even sparse topologies like ring graphs lead to a significant speed-up for many functions while not increasing the total number of function evaluations. We also give practical hints towards choosing the minimum number of processors that gives an optimal speed-up.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Nedjah, N., de Macedo Mourelle, L.: Parallel Evolutionary Computations. Springer, Heidelberg (2006)

    Book  MATH  Google Scholar 

  2. Tomassini, M.: Spatially Structured Evolutionary Algorithms: Artificial Evolution in Space and Time. Springer, Heidelberg (2005)

    MATH  Google Scholar 

  3. Cantú Paz, E.: A survey of parallel genetic algorithms. Technical report, Illinois Genetic Algorithms Laboratory, University of Illinois at Urbana Champaign, Urbana, IL (1997)

    Google Scholar 

  4. Rudolph, G.: Takeover time in parallel populations with migration. In: BIOMA 2006, pp. 63–72 (2006)

    Google Scholar 

  5. Wegener, I.: Methods for the analysis of evolutionary algorithms on pseudo-Boolean functions. In: Sarker, R., Yao, X., Mohammadian, M. (eds.) Evolutionary Optimization, pp. 349–369. Kluwer, Dordrecht (2002)

    Google Scholar 

  6. Lässig, J., Sudholt, D.: The benefit of migration in parallel evolutionary algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2010, pp. 1105–1112. ACM, New York (2010)

    Google Scholar 

  7. Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science 276, 51–81 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  8. He, J., Yao, X.: A study of drift analysis for estimating computation time of evolutionary algorithms. Natural Computing 3(1), 21–35 (2004)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. International Computer Science Institute, Berkeley, CA, 94704, USA

    Jörg Lässig & Dirk Sudholt

Authors
  1. Jörg Lässig
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dirk Sudholt
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Electrical Engineering, Automatics, Computer Science and Electronics, Department of ComputerScience, AGH University of Science and Technology, Mickiewicza 30, 30-059, Kraków, Poland

    Robert Schaefer

  2. Departamento de Lenguajes y Ciencias de la Computación, ETSI Informática, Universidad de Málaga, Campus Teatinos, 29071, Málaga, Spain

    Carlos Cotta

  3. Department of Mathematics and Computer Science, University of Bielsko-Biala, Willowa 2, 43-309, Bielsko-Biala, Poland

    Joanna Kołodziej

  4. Fakultät für Informatik, Technische Universität Dortmund, 44221, Dortmund, Germany

    Günter Rudolph

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lässig, J., Sudholt, D. (2010). General Scheme for Analyzing Running Times of Parallel Evolutionary Algorithms. In: Schaefer, R., Cotta, C., Kołodziej, J., Rudolph, G. (eds) Parallel Problem Solving from Nature, PPSN XI. PPSN 2010. Lecture Notes in Computer Science, vol 6238. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15844-5_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15844-5_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15843-8

  • Online ISBN: 978-3-642-15844-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation