By Topic

An Optimized MPI-based Approach for Solving the N-Queens Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Khademzadeh, A. ; Florida Inst. of Technol., Melbourne, FL, USA ; Sharbaf, M.A. ; Bayati, A.

The brute-force solution of n-queens problem is computationally expensive due to the large number of possible positioning of n number of queens on an n×n chessboard. In order to meet this challenge, the number of possibilities can be reduced by applying some rules, and the time needed to examine the remaining ones can become shorter by processing them with parallelism. We have introduced an optimized recursive parallel implementation of the n-queens problem using MPI which shows significant improvement in speed compared to the previous MPI version.

Published in:

P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC), 2012 Seventh International Conference on

Date of Conference:

12-14 Nov. 2012