Experience with a genetic algorithm implemented on a multiprocessor computer

  • Authors:

  • G. E. Plassman;J. Sobieszczanski-Sobieski

  • Affiliations:

  • Computer Sciences Corporation, 3217 North Armistead Avenue, Hampton, VA 23666-1379, USA e-mail: g.e.plassman@larc.nasa.gov, US;NASA Langley Research Center, M/S 139, 100 NASA Way, Hampton, VA 23681, USA e-mail: j.sobieski@larc.nasa.gov, US

  • Venue:
  • Structural and Multidisciplinary Optimization
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

Numerical experiments were conducted to find out the extent to which a Genetic Algorithm (GA) may benefit from a multiprocessor implementation, considering, on one hand, that analyses of individual designs in a population are independent of each other so that they may be executed concurrently on separate processors, and, on the other hand, that there are some operations in a GA that cannot be so distributed. The algorithm experimented with was based on a gaussian distribution rather than bit exchange in the GA reproductive mechanism, and the test case was a hub frame structure of up to 1080 design variables. The experimentation engaging up to 128 processors confirmed expectations of radical elapsed time reductions comparing to a conventional single processor implementation. It also demonstrated that the time spent in the nondistributable parts of the algorithm and the attendant cross-processor communication may have a very detrimental effect on the efficient utilization of the multiprocessor machine and on the number of processors that can be used effectively in a concurrent manner. Three techniques were devised and tested to mitigate that effect, resulting in efficiency increasing to exceed 99 percent. Of particular interest to the user, corresponding elapsed time compression factors approaching 128 are realized on 128 processors.