Rapidly Reconfigurable Field-Programmable Gate Arrays for Accelerating Fitness Evaluation in Genetic Programming   [FE] [GP]

by

Koza, J., R., Bennett III, F., H., Hutchings, J., L., Bade, S., L., Keane, M., A. and Andre, D.

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: Late Breaking Papers at the 1997 Genetic Programming Conference (Conference proceedings), 1997, p. 121-131
Keywords:genetic algorithms, genetic programming
Abstract:
The dominant component of the computational burden of solving non-trivial problems with evolutionary algorithms [EA] is the task of measuring the fitness of each individual in each generation of the evolving population. The advent of rapidly reconfigurable field-programmable gate arrays (FPGAs) and the idea of evolvable hardware [EH] opens the possiblity of embodying each individual of the evolving population into hardware for the purpose of accelerating the time-consuming fitness evaluation task [FE] This paper demonstrates how the massive parallelism of the rapidly reconfigurable Xilinx XC6216 FPGA can be exploited to accelerate the computationally burdensome fitness evaluation task [FE] of genetic programming. [GP] The work was done on Virtual Computing Corporation's low-cost HOTS expansion board for PC type computers. A 16-step 7-sorter was evolved that has two fewer steps than the sorting network [SN] described in the 1962 O'Connor and Nelson patent on sorting networks [SN] and that has the same number of steps as the minimal 7-sorter that was devised by Floyd and Knuth subsequent to the patent.
Notes:
GP-97LB The email address for the bookstore for mail orders is mailorder@bookstore.stanford.edu Phone no 415-329-1217 or 800-533-2670
URL(s):Postscript
(G)zipped postscript

Review item:

Mark as doublet (will be reviewed)

Print entry



BibTex:
@InProceedings{Koza:1997:rrFPGAafeGP,
  author =       "John R. Koza and Forrest H {Bennett III} and Jeffrey
                 L. Hutchings and Stephen L. Bade and Martin A. Keane
                 and David Andre",
  title =        "Rapidly Reconfigurable Field-Programmable Gate Arrays
                 for Accelerating Fitness Evaluation in Genetic
                 Programming",
  booktitle =    "Late Breaking Papers at the 1997 Genetic Programming
                 Conference",
  year =         "1997",
  editor =       "John R. Koza",
  pages =        "121--131",
  address =      "Stanford University, CA, USA",
  publisher_address = "Stanford University, Stanford, California,
                 94305-3079, USA",
  month =        "13--16 " # jul,
  publisher =    "Stanford Bookstore",
  keywords =     "genetic algorithms, genetic programming",
  ISBN =         "0-18-206995-8",
  URL =          "http://www-cs-faculty.stanford.edu/~koza/GPfgpa.ps",
  abstract =     "The dominant component of the computational burden of
                 solving non-trivial problems with evolutionary
                 algorithms is the task of measuring the fitness of each
                 individual in each generation of the evolving
                 population. The advent of rapidly reconfigurable
                 field-programmable gate arrays (FPGAs) and the idea of
                 evolvable hardware opens the possiblity of embodying
                 each individual of the evolving population into
                 hardware for the purpose of accelerating the
                 time-consuming fitness evaluation task This paper
                 demonstrates how the massive parallelism of the rapidly
                 reconfigurable Xilinx XC6216 FPGA can be exploited to
                 accelerate the computationally burdensome fitness
                 evaluation task of genetic programming. The work was
                 done on Virtual Computing Corporation's low-cost HOTS
                 expansion board for PC type computers. A 16-step
                 7-sorter was evolved that has two fewer steps than the
                 sorting network described in the 1962 O'Connor and
                 Nelson patent on sorting networks and that has the same
                 number of steps as the minimal 7-sorter that was
                 devised by Floyd and Knuth subsequent to the patent.",
  notes =        "GP-97LB The email address for the bookstore for mail
                 orders is mailorder@bookstore.stanford.edu Phone no
                 415-329-1217 or 800-533-2670",
}