Efficiency of parallel genetic algorithm for solving N-queens problem on multicomputer platform

Authors:
Milena Lazarova
Affiliations:
Department of Computer Systems, Technical University of Sofia, Sofia, Bulgaria
Venue:
EC'08 Proceedings of the 9th WSEAS International Conference on Evolutionary Computing
Year:
2008

Citing 14
Cited 0

Solving the n-queens problem using genetic algorithms

SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
A dynamic programming solution to the n-queens problem

Information Processing Letters
A survey of parallel distributed genetic algorithms

Complexity
A Glimpse of Constraint Satisfaction

Artificial Intelligence Review
Evolutionary algorithms and constraint satisfaction: definitions, survey, methodology, and research directions

Theoretical aspects of evolutionary computing
Analyzing synchronous and asynchronous parallel distributed genetic algorithms

Future Generation Computer Systems - Special issue on bio-impaired solutions to parallel processing problems
Data Mining: Concepts, Models, Methods and Algorithms

Data Mining: Concepts, Models, Methods and Algorithms
Migration Policies, Selection Pressure, and Parallel Evolutionary Algorithms

Journal of Heuristics
Distributed Genetic Algorithms

Proceedings of the 3rd International Conference on Genetic Algorithms
Parallel Genetic Algorithms

Proceedings of the 5th International Conference on Genetic Algorithms
GA-easy and GA-hard Constraint Satisfaction Problems

Constraint Processing, Selected Papers
A Modified Hopfield Model for Solving the N-Queens Problem

IJCNN '00 Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 6 - Volume 6
Genetic Algorithms: Principles and Perspectives: A Guide to GA Theory

Genetic Algorithms: Principles and Perspectives: A Guide to GA Theory
Practical Genetic Algorithms with CD-ROM

Practical Genetic Algorithms with CD-ROM

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper investigates the efficiency of parallel genetic algorithm for solving N-queens problem on a multicomputer platform. The proposed parallel computational model of the genetic algorithm is based on a parallel algorithmic paradigm of synchronous iterations. Dynamic migration of randomly selected chromosomes in a bidirectional circular model is utilized. The algorithm is implemented using both flat (pure MPI) and hybrid (MPI+OpenMP) programming models. The target parallel multicomputer platform is a cluster of SMPs. Performance profiling and scalability analyses have been made in respect of both the workload (board size) and the size of the parallel system.