# IMPLEMENTING GENETIC ALGORITHMS TO CUDA ENVIRONMENT USING DATA PARALLELIZATION

@article{Oiso2011IMPLEMENTINGGA, title={IMPLEMENTING GENETIC ALGORITHMS TO CUDA ENVIRONMENT USING DATA PARALLELIZATION}, author={Masashi Oiso and Yoshiyuki Matsumura and Toshiyuki Yasuda and Kazuhiro Ohkura}, journal={Tehnicki Vjesnik-technical Gazette}, year={2011}, volume={18}, pages={511-517} }

Computation methods of parallel problem solving using graphic processing units (GPUs) have attracted much research interests in recent years. Parallel computation can be applied to genetic algorithms (GAs) in terms of the evaluation process of individuals in a population. This paper describes yet another implementation method of GAs to the CUDA environment where CUDA is a general-purpose computation environment for GPUs provided by NVIDIA. The major characteristic point of this study is that…

## Figures, Tables, and Topics from this paper

## 14 Citations

A review of Genetic Algorithms and Parallel Genetic Algorithms on Graphics Processing Unit (GPU)

- Computer Science2013 IEEE International Conference on Control System, Computing and Engineering
- 2013

This review attempts to study and analyse the behaviour of GA and parallel GA categories to work in GPU depending on the type of genetic algorithm.

GENETIC ALGORITHM ON GENERAL PURPOSE GRAPHICS PROCESSING UNIT: PARALLELISM REVIEW

- Computer ScienceSOCO 2013
- 2013

Papers gives review of various applications solved using GAs on GPGPU with the future scope in the area of optimization and suggests speedup can definitely be achieved if bottleneck in GAs are identified and implemented effectively on G PGPU.

REVIEW OF PARALLEL GENETIC ALGORITHM BASED ON COMPUTING PARADIGM AND DIVERSITY IN SEARCH SPACE

- Computer ScienceSOCO 2013
- 2013

An overview of theoretical advances and computing trends, particularly population diversity in PGA (Parallel GA) is given and information about how various authors, researchers, scientists have parallelized GA over various parallel computing paradigms viz.

Implementation of an improved parallel metaheuristic on GPU applied to humanoid robot simulation

- Computer Science2014 International Conference on Multimedia Computing and Systems (ICMCS)
- 2014

A new methodology for the implementation of a GPU processor of a bio-inspired technique realizing the evolution of walking behavior for a simulated humanoid robot is presented, which enables efficient mapping between the explored research space and the hierarchy's own GPU memory.

Accelerating genetic algorithms with GPU computing: A selective overview

- Computer ScienceComput. Ind. Eng.
- 2019

The concept of granularity of parallelism for GAs on GPU architecture is reexamine, how the aspect of data layout affect the kernel design to maximize memory bandwidth is discussed, and how to organize threads in grid and blocks to expose sufficient parallelism to GPU is explained.

Parallel GA in Big Data Analysis

- Computer Science
- 2016

This chapter describes the parallelization issues in Genetic Algorithms (GA) and use of various Big data mechanisms over parallel GA models.

Towards an autonomously configured parallel genetic algorithm: Deme size and deme number

- Computer Science2016 2nd IEEE International Conference on Computer and Communications (ICCC)
- 2016

This paper will present a method to determine efficient deme size and deme number that can be calculated during runtime with no human interaction, which takes convergence theory methodology as the basis and makes accommodation for graphical processing unit architecture to allow for efficient computational performance.

GPU-based Parallelization for Schedule Optimization with Uncertainty

- Computer Science
- 2014

A GPU-based implementation of the scheduling optimization with uncertainty achieving a 637x speed up in Monte Carlo simulations and a 154x speedup for the entire algorithm compared to a sequential implementation is presented.

Evolutionary induction of a decision tree for large-scale data: a GPU-based approach

- Computer ScienceSoft Comput.
- 2017

A comparison with the traditional CPU version shows that evolutionary induction of decision trees supported by GPGPU can be accelerated significantly (even up to 800 times) and allows for processing of much larger datasets.

An improved CUDA-based hybrid metaheuristic for fast controller of an evolutionary robot

- Computer ScienceInt. J. Embed. Syst.
- 2018

The effectiveness of the proposed parallel evolutionary training technique was validated for real movements of humanoid robots and showed a promising speed-up, since this field requires very high powerful computational resources.

## References

SHOWING 1-10 OF 21 REFERENCES

Solving quadratic assignment problems by genetic algorithms with GPU computation: a case study

- Computer ScienceGECCO '09
- 2009

A multiple-population, coarse-grained GA with GPU computation to solve the quadratic assignment problem (QAP) which is one of the hardest optimization problems in permutation domains is described.

Accelerating Genetic Programming through Graphics Processing Units.

- Computer Science
- 2009

In this chapter, Genetic Programming methods currently ported are surveyed and the true degree of parallelism of GPUs is often hidden from the user, making programming even more flexible and convenient.

Fast Genetic Programming and Artificial Developmental Systems on GPUs

- Computer Science21st International Symposium on High Performance Computing Systems and Applications (HPCS'07)
- 2007

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.

An analytical study of GPU computation for solving QAPs by parallel evolutionary computation with independent run

- Computer ScienceIEEE Congress on Evolutionary Computation
- 2010

An evolutionary algorithm for solving QAPs with parallel independent run using GPU computation that achieves a GPU computation performance that is nearly proportional to the number of equipped multi-processors in the GPUs.

A SIMD Interpreter for Genetic Programming on GPU Graphics Cards

- Computer ScienceEuroGP
- 2008

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.

Dense Matrix-Vector Multiplication on the CUDA Architecture

- Computer ScienceParallel Process. Lett.
- 2008

The performance of Jacobi's iterative method for solving linear equations, which includes the data transfer time between CPU and GPU, shows that the proposed algorithm is practical for real applications.

Population Parallel GP on the G80 GPU

- Computer ScienceEuroGP
- 2008

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.

Efficient Hierarchical Parallel Genetic Algorithms using Grid computing

- Computer ScienceFuture Gener. Comput. Syst.
- 2007

An empirical study on GE-HPGA using a benchmark problem and a realistic aerodynamic airfoil shape optimization problem for diverse Grid environments having different communication protocols, cluster sizes, processing nodes, at geographically disparate locations indicates that the proposed GE- HPGA offers a credible framework for providing a significant speed-up to evolutionary design optimization in science and engineering.

Brook for GPUs: stream computing on graphics hardware

- Computer ScienceSIGGRAPH 2004
- 2004

This paper presents Brook for GPUs, a system for general-purpose computation on programmable graphics hardware that abstracts and virtualizes many aspects of graphics hardware, and presents an analysis of the effectiveness of the GPU as a compute engine compared to the CPU.

An Experimental Analysis of Parallel Sorting Algorithms

- Computer ScienceTheory of Computing Systems
- 1998

A methodology for predicting the performance of parallel algorithms on real parallel machines and selected the three most promising, Batcher's bitonic sort, a parallel radix sort, and a sample sort similar to Reif and Valiant's flashsort, and implemented them on the connection Machine model CM-2.