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

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.

[1]  S. R. Sathe,et al.  Comparison of OpenMP & OpenCL Parallel Processing Technologies , 2012, ArXiv.

[2]  Qing Wang,et al.  A high order neural network to solve N-queens problem , 2010, The 2010 International Joint Conference on Neural Networks (IJCNN).

[3]  Timothy G. Mattson,et al.  OpenCL Programming Guide , 2011 .

[4]  Andreas Polze,et al.  NQueens on CUDA: Optimization Issues , 2010, 2010 Ninth International Symposium on Parallel and Distributed Computing.

[5]  Tianlong Gu,et al.  A Novel Assembly Evolutionary Algorithm for n-Queens Problem , 2007, 2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007).

[6]  Jie Cheng,et al.  Programming Massively Parallel Processors. A Hands-on Approach , 2010, Scalable Comput. Pract. Exp..

[7]  Stevo Bozinovski,et al.  N-queens pattern generation: an insight into space complexity of a backtracking algorithm , 2004, ISICT.

[8]  Timothy J. Rolfe.  A specimen MPI application: N-Queens in parallel , 2008, SGCS.

[9]  John Waldron.  Proceedings of the 2004 international symposium on Information and communication technologies , 2004 .

[10]  Timothy J. Rolfe,et al.  Las Vegas does n-queens , 2006, SGCS.

[11]  David Kaeli,et al.  Heterogeneous Computing with OpenCL , 2011 .

[12]  Janice M. Stone,et al.  Efficient Search Techniques - An Empirical Study of the N-Queens Problem , 1987, IBM J. Res. Dev..

[13]  Voicu Groza,et al.  Accelerating N-queens problem using OpenMP , 2011, 2011 6th IEEE International Symposium on Applied Computational Intelligence and Informatics (SACI).