Presentation 2011-06-30
Accelerating Computation of Combinatorial Optimization Problems Using GPGPU
Toshihiro TACHIBANA, Masaharu ADACHI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Recently, graphics processing units (GPUs) are used for general purpose computing which is called GPGPU. A feature of GPGPU is executing parallel computation by many GPU cores. In this paper, GPGPU calculation is used for several methods of combinatorial optimization problems using chaotic neurodynamics. In this paper, quadratic assignment problem is examined. From numerical experimental results, the application of GPGPU succeeded to reduce drastically the computational time.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) GPGPU / CUDA / Quadratic assignment problems / Combinatorial optimization problems
Paper # NLP2011-34
Date of Issue

Conference Information
Committee NLP
Conference Date 2011/6/23(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Nonlinear Problems (NLP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Accelerating Computation of Combinatorial Optimization Problems Using GPGPU
Sub Title (in English)
Keyword(1) GPGPU
Keyword(2) CUDA
Keyword(3) Quadratic assignment problems
Keyword(4) Combinatorial optimization problems
1st Author's Name Toshihiro TACHIBANA
1st Author's Affiliation Graduate School of Advanced Science and Technology, Tokyo Denki University()
2nd Author's Name Masaharu ADACHI
2nd Author's Affiliation Graduate School of Advanced Science and Technology, Tokyo Denki University
Date 2011-06-30
Paper # NLP2011-34
Volume (vol) vol.111
Number (no) 106
Page pp.pp.-
#Pages 6
Date of Issue