.png){kind=icon}
返回
GPU Computing for Parallel Local Search Metaheuristic Algorithms
.png){kind=icon}
OA
AI
DOI：10.1109/TC.2011.206.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Local search metaheuristics (LSMs) are efficient methods for solving complex problems in science and industry. They allow significantly to reduce the size of the search space to be explored and the search time. Nevertheless, the resolution time remains prohibitive when dealing with large problem instances. Therefore, the use of GPU-based massively parallel computing is a major complementary way to speed up the search. However, GPU computing for LSMs is rarely investigated in the literature. In this paper, we introduce a new guideline for the design and implementation of effective LSMs on GPU. Very efficient approaches are proposed for CPU-GPU data transfer optimization, thread control, mapping of neighboring solutions to GPU threads, and memory management. These approaches have been experimented using four well-known combinatorial and continuous optimization problems and four GPU configurations. Compared to a CPU-based execution, accelerations up to x 80 are reported for the large combinatorial problems and up to x 240 for a continuous problem. Finally, extensive experiments demonstrate the strong potential of GPU-based LSMs compared to cluster or grid-based parallel architectures.
Keyword:
Parallel metaheuristics
local search metaheuristics
GPU computing
performance evaluation
期刊
IF:
3.8
论文数:
5.3K
被引数:
9.8K
机构
引用论文
Postconcussive symptoms in OEF–OIF veterans: Factor structure and impact of posttraumatic stress.Oef-oif退伍军人的脑震荡后症状: 创伤后应激的因素结构和影响。
.png){kind=icon}
PREAI
分享收藏
Parallel implementation of the 2D discrete wavelet transform on Graphics Processing Units:: Filter Bank versus Lifting二维离散小波变换在图形处理单元上的并行实现:: 滤波器组与提升
PREAI
分享收藏
查看更多内容