Parallel Genetic Programming: A Scalable Implementation Using The Transputer Network Architecture   [PGP] [GP]

by

Andre, D. and Koza, J., R.

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. 317-338
Keywords:genetic algorithms, genetic programming
Abstract:
This chapter describes the parallel implementation [PI] of genetic programming [GP] in the C programming language using a PC type computer (running Windows) acting as a host and a network of processing nodes using the transputer architecture. Using this approach, researchers of genetic algorithms [GA] and genetic programming [GP] can acquire computing power that is intermediate between the power of currently available workstations and that of supercomputers at a cost that is intermediate between the two. This approach is illustrated by a comparison of the computational effort [CE] required to solve the problem of symbolic regression [SR] of the Boolean even-5-parity function with different migration rates. Genetic programming [GP] required the least computational effort [CE] with an 5% migration rate. Moreover, this computational effort [CE] was less than that required for solving the problem with a serial computer and a panmictic population of the same size. That is, apart from the nearly linear speed-up in executing a fixed amount of code inherent in the parallel implementation [PI] of genetic programming, [GP] the use of distributed sub-populations with only limited migration delivered more than linear speed-up in solving the problem.
Author(s) DL:Online papers for Andre, D.
Online papers for Koza, J., R.
Internet search:Search Google
Search Google Scholar
Search Citeseer using Google
Search Google for PDF
Search Google Scholar for PDF
Search Citeseer for PDF using Google

Review item:

Mark as doublet (will be reviewed)

Print entry



BibTex:
@InCollection{andre:1996:aigp2,
  author =       "David Andre and John R. Koza",
  title =        "Parallel Genetic Programming: {A} Scalable
                 Implementation Using The Transputer Network
                 Architecture",
  booktitle =    "Advances in Genetic Programming 2",
  publisher =    "MIT Press",
  year =         "1996",
  editor =       "Peter J. Angeline and K. E. {Kinnear, Jr.}",
  pages =        "317--338",
  chapter =      "16",
  address =      "Cambridge, MA, USA",
  keywords =     "genetic algorithms, genetic programming",
  ISBN =         "0-262-01158-1",
  abstract =     "This chapter describes the parallel implementation of
                 genetic programming in the C programming language using
                 a PC type computer (running Windows) acting as a host
                 and a network of processing nodes using the transputer
                 architecture. Using this approach, researchers of
                 genetic algorithms and genetic programming can acquire
                 computing power that is intermediate between the power
                 of currently available workstations and that of
                 supercomputers at a cost that is intermediate between
                 the two. This approach is illustrated by a comparison
                 of the computational effort required to solve the
                 problem of symbolic regression of the Boolean
                 even-5-parity function with different migration rates.
                 Genetic programming required the least computational
                 effort with an 5% migration rate. Moreover, this
                 computational effort was less than that required for
                 solving the problem with a serial computer and a
                 panmictic population of the same size. That is, apart
                 from the nearly linear speed-up in executing a fixed
                 amount of code inherent in the parallel implementation
                 of genetic programming, the use of distributed
                 sub-populations with only limited migration delivered
                 more than linear speed-up in solving the problem.",
}