• Corpus ID: 17692097

Genetic Programming on GPUs using CUDA

@inproceedings{Harding2009GeneticPO,
  title={Genetic Programming on GPUs using CUDA},
  author={Simon Harding},
  year={2009}
}
Using of a cluster of Graphics Processing Unit (GPU) equipped computers, it is possible to accelerate the evaluation of individuals in Genetic Programming. Program compilation, fitness case data and fitness execution are spread over the cluster of computers, allowing for the efficient processing of very large datasets. Here, the implementation is demonstrated on datasets containing over 10 million rows and several hundred megabytes in size. Populations of candidate individuals are compiled into… 

References

SHOWING 1-10 OF 15 REFERENCES
Fast Genetic Programming on GPUs
TLDR
This paper demonstrates the use of the Graphics Processing Unit (GPU) to accelerate the evaluation of individuals, and shows that for both binary and floating point based data types, it is possible to get speed increases of several hundred times over a typical CPU implementation.
A SIMD Interpreter for Genetic Programming on GPU Graphics Cards
TLDR
Using the RapidMind general processing on GPU (GPGPU) framework, an entire population of a quarter of a million individual programs on a non-trivial problem in 4 seconds is evaluated.
A data parallel approach to genetic programming using programmable graphics hardware
TLDR
This paper describes the technique of general purpose computing using graphics cards and how to extend this technique to genetic programming and demonstrates the improvement in the performance of genetic programming on single processor architectures which can be achieved by harnessing the computing power of these next generation graphics cards.
Evolution of image filters on graphics processor units using Cartesian Genetic Programming
  • Simon Harding
  • Computer Science
    2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)
  • 2008
TLDR
This work uses Cartesian Genetic Programming to generate shader programs that implement image filter operations that can be rapidly applied to each pixel in an image and evaluate the performance of a given filter.
Genetic programming on GPUs for image processing
TLDR
It is demonstrated that other more complicated processes can also be successfully evolved and that the authors can 'reverse engineer' the output from filters used in common graphics manipulation programs.
Population Parallel GP on the G80 GPU
TLDR
Using the CUDA language on the G80 GPU, it is shown it is possible to efficiently interpret several GP programs in parallel, thus obtaining speedups also for small training sets starting at less than 100 training cases.
Fast Genetic Programming and Artificial Developmental Systems on GPUs
  • Simon Harding, W. Banzhaf
  • Computer Science
    21st International Symposium on High Performance Computing Systems and Applications (HPCS'07)
  • 2007
TLDR
It is shown that it is possible to get speed increases of several hundred times over a typical CPU implementation, catapulting GPU processing for genetic programming approaches into the realm of HPC.
Accelerator: using data parallelism to program GPUs for general-purpose uses
TLDR
This work describes Accelerator, a system that uses data parallelism to program GPUs for general-purpose uses instead of C, and compares the performance of Accelerator versions of the benchmarks against hand-written pixel shaders.
Linear genetic programming GPGPU on Microsoft’s Xbox 360
  • G. Wilson, W. Banzhaf
  • Computer Science
    2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)
  • 2008
TLDR
A linear GP (LGP) system is implemented to solve classification and regression problems of the Xbox 360, having the potential to alleviate typical GPGPU decisions of allocating particular functionalities to CPU or GPU.
Cartesian Genetic Programming
TLDR
A neutral search strategy that allows the fittest genotype to be replaced by another equally fit genotype (a neutral genotype) is examined and compared with non-neutral search for the Santa Fe ant problem and the neutral search proves to be much more effective.
...
1
2
...