Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

On the scalability of parallel genetic algorithms.

E Cantú-Paz1, D E Goldberg

  • 1Center for Apllied Scientific Computing, Lawrence LivermoreNational Laboratory, Livermore, CA 94551, USA. cantupaz@llnl.gov

Evolutionary Computation
|December 1, 1999
PubMed
Summary

This study on parallel genetic algorithms (GAs) finds the optimal number of processors scales with population size and evaluation time. This indicates GAs can significantly reduce execution time for complex problems.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Seismogeodetic P-wave Amplitude: No Evidence for Strong Determinism.

Geophysical research letters·2020
Same author

Geodetic Observations of Weak Determinism in Rupture Evolution of Large Earthquakes.

Journal of geophysical research. Solid earth·2019
Same author

Using previous models to bias structural learning in the hierarchical BOA.

Evolutionary computation·2011
Same author

The nature and frequency of neovascular age-related macular degeneration.

European journal of ophthalmology·2007
Same author

Hemoglobin degradation.

Current topics in microbiology and immunology·2005
Same author

Long term visual outcome of patients with cytomegalovirus retinitis treated with highly active antiretroviral therapy.

The British journal of ophthalmology·2003

Area of Science:

  • Computer Science
  • Artificial Intelligence
  • Computational Optimization

Background:

  • Parallel genetic algorithms (GAs) are crucial for optimizing complex problems.
  • Understanding the scalability of different parallel GA types is essential for efficient computation.
  • Previous research has not fully explored the optimal processor allocation for minimizing execution time across various parallel GA architectures.

Purpose of the Study:

  • To analyze the scalability of single and multiple population parallel genetic algorithms.
  • To determine the optimal number of processors for minimizing execution time in parallel GAs.
  • To provide theoretical and experimental insights into parallel GA performance.

Main Methods:

  • Theoretical analysis of single-population and multiple-population parallel GAs.

Related Experiment Videos

  • Investigation of distributed and master-slave architectures for single-population GAs.
  • Examination of maximal and minimal migration parameters in multiple-population GAs.
  • Experimental validation using an additively-decomposable function.

    • Main Results:

    • The optimal number of processors is directly proportional to the square root of population size and fitness evaluation time.
    • Scalability analysis reveals performance characteristics for different parallel GA configurations.
    • Theoretical calculations are supported by experimental evidence, confirming the findings.

    Conclusions:

    • Parallel genetic algorithms demonstrate significant potential for reducing execution time in practical applications.
    • The optimal processor count increases with problem complexity (larger population size, longer evaluation time).
    • These findings suggest that parallel GAs can effectively leverage large numbers of processors for enhanced computational efficiency.