Solving N-Queens problem on GPU architecture using OpenCL with special reference to synchronization issues

Author

Thouti, K. ; Sathe, Shailesh R.

Author_Institution

Dept. of Comput. Sci. & Eng., Visvesvaraya Nat. Inst. of Technol., Nagpur, India

fYear

2012

fDate

6-8 Dec. 2012

Firstpage

806

Lastpage

810

Abstract

The N-Queens problem is to place N queens on an N × N chessboard such that no two queens attack each other. General purpose computing on graphics processing units (GPGPU) is fast becoming a common feature of high performance computing. This paper investigates cost of finding the solutions to N-Queens problem on GPGPU architecture using OpenCL programming model. We extensively analyze the N-Queen problem with respect to local, global memory parameters and atomicity and synchronization issues in OpenCL and its effects on performance. Experimental results are shown on NVidia Quadro FX 3800 GPU. Using Queens between 16 and 21, we observed average speedup of 20x.

Keywords

application program interfaces; game theory; graphics processing units; multiprocessing systems; parallel architectures; GPGPU architecture; N-queens problem; NVidia Quadro FX 3800 GPU; OpenCL programming model; atomicity issues; general purpose computing-on-graphics processing units; global memory parameters; local memory parameters; many-core processor; synchronization issues; Artificial neural networks; Graphics processing units; Performance evaluation; Synchronization; GPGPU; Graphical processors; N-Queen problem; OpenCL; Parallel copmuting;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Distributed and Grid Computing (PDGC), 2012 2nd IEEE International Conference on

Conference_Location

Solan

Print_ISBN

978-1-4673-2922-4

Type

conf

DOI

10.1109/PDGC.2012.6449926

Filename

6449926