Massively Parallel Genetic Programming   [PGP] [GP]

by

Juillé, H. and Pollack, J., B.

Literature search on Evolutionary ComputationBBase ©1999-2013, Rasmus K. Ursem
     Home · Search · Adv. search · Authors · Login · Add entries   Webmaster
Note to authors: Please submit your bibliography and contact information - online papers are more frequently cited.

Info: Advances in Genetic Programming 2, 1996, p. 339-358
Keywords:genetic algorithms, genetic programming
Abstract:
As the field of Genetic Programming (GP) [GP] matures and its breadth of application increases, the need for parallel implementations becomes absolutely necessary. The transputer-based system presented in [Koza95] is one of the rare such parallel implementations. Until today, no implementation has been proposed for parallel GP using a SIMD architecture, except for a data-parallel approach [tufts95], although others have exploited workstation farms and pipelined supercomputers. One reason is certainly the apparent difficulty of dealing with the parallel evaluation of different S-expressions when only a single instruction can be executed at the same time on every processor. The aim of this chapter is to present such an implementation of parallel GP on a SIMD system, where each processor can efficiently evaluate a different S-expression. We have implemented this approach on a MasPar MP-2 computer, and will present some timing results. To the extent that SIMD machines, like the MasPar are available to offer cost-effective cycles for scientific experimentation, this is a useful approach.
Notes:
tic-tak-toe, intertwined spirals, coevolution
URL(s):(G)zipped postscript

Review item:

Mark as doublet (will be reviewed)

Print entry




BibTex:
@InCollection{pollack:1996:aigp2,
  author =       "Hugues Juille and Jordan B. Pollack",
  title =        "Massively Parallel Genetic Programming",
  booktitle =    "Advances in Genetic Programming 2",
  publisher =    "MIT Press",
  year =         "1996",
  editor =       "Peter J. Angeline and K. E. {Kinnear, Jr.}",
  pages =        "339--358",
  chapter =      "17",
  address =      "Cambridge, MA, USA",
  keywords =     "genetic algorithms, genetic programming",
  ISBN =         "0-262-01158-1",
  URL =          "ftp://ftp.cs.brandeis.edu/pub/faculty/pollack/gp2.ps.Z",
  abstract =     "As the field of Genetic Programming (GP) matures and
                 its breadth of application increases, the need for
                 parallel implementations becomes absolutely necessary.
                 The transputer-based system presented in [Koza95] is
                 one of the rare such parallel implementations. Until
                 today, no implementation has been proposed for parallel
                 GP using a SIMD architecture, except for a
                 data-parallel approach [tufts95], although others have
                 exploited workstation farms and pipelined
                 supercomputers. One reason is certainly the apparent
                 difficulty of dealing with the parallel evaluation of
                 different S-expressions when only a single instruction
                 can be executed at the same time on every processor.
                 The aim of this chapter is to present such an
                 implementation of parallel GP on a SIMD system, where
                 each processor can efficiently evaluate a different
                 S-expression. We have implemented this approach on a
                 MasPar MP-2 computer, and will present some timing
                 results. To the extent that SIMD machines, like the
                 MasPar are available to offer cost-effective cycles for
                 scientific experimentation, this is a useful
                 approach.

                 ",
  notes =        "tic-tak-toe, intertwined spirals, coevolution",
  size =         "21 pages",
}