Optimization of Parallel Genetic Algorithms for nVidia GPUs

被引:0
|
作者
Wahib, Mohamed [1 ]
Munawar, Asim [1 ]
Munetomo, Masaharu [2 ]
Akama, Kiyoshi [2 ]
机构
[1] Hokkaido Univ, Grad Sch Informat Sci & Technol, Sapporo, Hokkaido, Japan
[2] Hokkaido Univ, Informat Initiat Ctr, Informat Syst Design Lab, Sapporo, Japan
关键词
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Led by General Purpose computing over Graphical Processing Units (GPGPUs), the parallel computing area is witnessing a rapid change in dominant parallel systems. A major hurdle in this switch is the Single Instruction Multiple Thread (SIMT) architecture of GPUs which is usually not suitable for the design of legacy parallel algorithms. Genetic Algorithms (GAs) is no exception for that. GAs are commonly parallelized due to the high demanding computational needs. Given the performance of GPGPUs, the need to best exploit them to maximize computing efficiency for parallel GAs is demandingly growing. The goal of this paper is to shed light on the challenges parallel GAs designers/programmers will likely face while trying to achieve this, and to provide some practical advice on how to maximize GPGPU exploitation as a result. To that end, this paper provides a study on adapting legacy parallel GAs on GPGPU systems. The paper exposes the design challenges of nVidia's GPU architecture to the parallel GAs community by: discussing features of GPU, reviewing design issues in GPU relevant to parallel GAs, the design and introduction of new techniques to achieve an efficient implementation for parallel GAs and observing the effect of the pivotal points that both capitalize on the strengths of GPU and limit the deficiencies/overheads of GPUs. The paper demonstrates the performance of designed-for-GPGPU parallel GAs representing the entire spectrum of legacy parallel model of GAs over nVidia Tesla C1060 workstation showing a significant improvement in performance after optimizing and tuning the algorithms for GPU.
引用
收藏
页码:803 / 811
页数:9
相关论文
共 50 条
  • [31] The use of parallel genetic algorithms for optimization in the early design phases
    Slaby, E
    Funk, W
    PARALLEL COMPUTING: SOFTWARE TECHNOLOGY, ALGORITHMS, ARCHITECTURES AND APPLICATIONS, 2004, 13 : 103 - 110
  • [32] PARALLEL GENETIC ALGORITHMS, POPULATION-GENETICS AND COMBINATORIAL OPTIMIZATION
    MUHLENBEIN, H
    LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, 1991, 565 : 398 - 406
  • [33] PARALLEL BIASED SEARCH FOR COMBINATORIAL OPTIMIZATION - GENETIC ALGORITHMS AND TABU
    BATTITI, R
    TECCHIOLLI, G
    MICROPROCESSORS AND MICROSYSTEMS, 1992, 16 (07) : 351 - 367
  • [34] Optimization of a Solver for Computational Materials and Structures Problems on NVIDIA Volta and AMD Instinct GPUs
    Zubair, Mohammad
    Warner, James
    Wagner, David
    PROCEEDINGS OF SCALA 2019: 2019 IEEE/ACM 10TH WORKSHOP ON LATEST ADVANCES IN SCALABLE ALGORITHMS FOR LARGE-SCALE SYSTEMS (SCALA), 2019, : 9 - 16
  • [35] PARALLEL ARCHITECTURES AND INTRINSICALLY PARALLEL ALGORITHMS - GENETIC ALGORITHMS
    CAMPANINI, R
    DICARO, G
    VILLANI, M
    DANTONE, I
    GIUSTI, G
    INTERNATIONAL JOURNAL OF MODERN PHYSICS C-PHYSICS AND COMPUTERS, 1994, 5 (01): : 95 - 112
  • [36] PARALLEL GENETIC ALGORITHMS
    Linder, Marek
    Sekaj, Ivan
    MENDEL 2011 - 17TH INTERNATIONAL CONFERENCE ON SOFT COMPUTING, 2011, : 9 - 15
  • [37] Parallel genetic algorithms
    Shonkwiler, R.
    Australian Electronics Engineering, 1994, 27 (02):
  • [38] Designing and Optimizing Compute Kernels on NVIDIA GPUs
    Jamsek, Damir A.
    PROCEEDINGS OF THE ASP-DAC 2009: ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE 2009, 2009, : 224 - 229
  • [39] An Evaluation of Unified Memory Technology on NVIDIA GPUs
    Li, Wenqiang
    Jin, Guanghao
    Cui, Xuewen
    See, Simon
    2015 15TH IEEE/ACM INTERNATIONAL SYMPOSIUM ON CLUSTER, CLOUD AND GRID COMPUTING, 2015, : 1092 - 1098
  • [40] Accelerating algebraic multigrid solvers on NVIDIA GPUs
    Liu, Hui
    Yang, Bo
    Chen, Zhangxin
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2015, 70 (05) : 1162 - 1181