Accelerated execution of P systems with active membranes to solve the N-queens problem

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

The N-queens problem has attracted increasing attention because of its potential applications in different areas, such as parallel memory storage approaches, image processing, and physical and chemical studies. Local search is a powerful method for solving real problems, such as the N-queens problem. Recently, models of P systems with active membranes have been used for local search to solve the N-queens problem. However, there have been insufficient studies of the parallelism of the P-system models with active membranes. In addition, the active membrane systems defined for N queens have several individual membranes that contain one object and no internal rules in each membrane, as well as several communication rules among membranes, which reduce the execution speed. In this study, a new P system model with active membranes is defined for solving the N-queens problem, and multi-core simulation of the proposed membrane system allows the execution of alternative computations in parallel, thus reducing the average time for finding a successful computation. The speed of the proposed model was compared with previous models that used P systems with active membranes for local search. The model contains two membranes, but the inclusion of several objects and rules within each membrane increases the parallelism and performance. This model reduces the number of communication rules required among membranes, and increases the execution speed. This model also increases the parallelism of previous P systems with active membranes when several rules evolve concurrently and more than one queen is exchanged during each step to reach a solution. Multi-core processing has been used to decrease the probability of restarting the P systems and to decrease processing time by distributing the processing of the active membrane on the multi-core. The speed of the proposed model when solving N= 200 queens was almost 1000 times faster than previous methods.

Original languageEnglish
Pages (from-to)39-54
Number of pages16
JournalTheoretical Computer Science
Volume551
Issue numberC
DOIs
Publication statusPublished - 2014

Fingerprint

P Systems
Membrane
Membranes
Local Search
Parallelism
Model
Processing
Decrease
Communication
Time-average
Image Processing

Keywords

  • Active membrane systems
  • Local search
  • Membrane computing
  • Multi-core processing
  • N-queens problem

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Accelerated execution of P systems with active membranes to solve the N-queens problem. / Maroosi, Ali; Muniyandi, Ravie Chandren.

In: Theoretical Computer Science, Vol. 551, No. C, 2014, p. 39-54.

Research output: Contribution to journalArticle

@article{ca93df0b1cb44353b9552f0d82423e51,
title = "Accelerated execution of P systems with active membranes to solve the N-queens problem",
abstract = "The N-queens problem has attracted increasing attention because of its potential applications in different areas, such as parallel memory storage approaches, image processing, and physical and chemical studies. Local search is a powerful method for solving real problems, such as the N-queens problem. Recently, models of P systems with active membranes have been used for local search to solve the N-queens problem. However, there have been insufficient studies of the parallelism of the P-system models with active membranes. In addition, the active membrane systems defined for N queens have several individual membranes that contain one object and no internal rules in each membrane, as well as several communication rules among membranes, which reduce the execution speed. In this study, a new P system model with active membranes is defined for solving the N-queens problem, and multi-core simulation of the proposed membrane system allows the execution of alternative computations in parallel, thus reducing the average time for finding a successful computation. The speed of the proposed model was compared with previous models that used P systems with active membranes for local search. The model contains two membranes, but the inclusion of several objects and rules within each membrane increases the parallelism and performance. This model reduces the number of communication rules required among membranes, and increases the execution speed. This model also increases the parallelism of previous P systems with active membranes when several rules evolve concurrently and more than one queen is exchanged during each step to reach a solution. Multi-core processing has been used to decrease the probability of restarting the P systems and to decrease processing time by distributing the processing of the active membrane on the multi-core. The speed of the proposed model when solving N= 200 queens was almost 1000 times faster than previous methods.",
keywords = "Active membrane systems, Local search, Membrane computing, Multi-core processing, N-queens problem",
author = "Ali Maroosi and Muniyandi, {Ravie Chandren}",
year = "2014",
doi = "10.1016/j.tcs.2014.05.004",
language = "English",
volume = "551",
pages = "39--54",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "C",

}

TY - JOUR

T1 - Accelerated execution of P systems with active membranes to solve the N-queens problem

AU - Maroosi, Ali

AU - Muniyandi, Ravie Chandren

PY - 2014

Y1 - 2014

N2 - The N-queens problem has attracted increasing attention because of its potential applications in different areas, such as parallel memory storage approaches, image processing, and physical and chemical studies. Local search is a powerful method for solving real problems, such as the N-queens problem. Recently, models of P systems with active membranes have been used for local search to solve the N-queens problem. However, there have been insufficient studies of the parallelism of the P-system models with active membranes. In addition, the active membrane systems defined for N queens have several individual membranes that contain one object and no internal rules in each membrane, as well as several communication rules among membranes, which reduce the execution speed. In this study, a new P system model with active membranes is defined for solving the N-queens problem, and multi-core simulation of the proposed membrane system allows the execution of alternative computations in parallel, thus reducing the average time for finding a successful computation. The speed of the proposed model was compared with previous models that used P systems with active membranes for local search. The model contains two membranes, but the inclusion of several objects and rules within each membrane increases the parallelism and performance. This model reduces the number of communication rules required among membranes, and increases the execution speed. This model also increases the parallelism of previous P systems with active membranes when several rules evolve concurrently and more than one queen is exchanged during each step to reach a solution. Multi-core processing has been used to decrease the probability of restarting the P systems and to decrease processing time by distributing the processing of the active membrane on the multi-core. The speed of the proposed model when solving N= 200 queens was almost 1000 times faster than previous methods.

AB - The N-queens problem has attracted increasing attention because of its potential applications in different areas, such as parallel memory storage approaches, image processing, and physical and chemical studies. Local search is a powerful method for solving real problems, such as the N-queens problem. Recently, models of P systems with active membranes have been used for local search to solve the N-queens problem. However, there have been insufficient studies of the parallelism of the P-system models with active membranes. In addition, the active membrane systems defined for N queens have several individual membranes that contain one object and no internal rules in each membrane, as well as several communication rules among membranes, which reduce the execution speed. In this study, a new P system model with active membranes is defined for solving the N-queens problem, and multi-core simulation of the proposed membrane system allows the execution of alternative computations in parallel, thus reducing the average time for finding a successful computation. The speed of the proposed model was compared with previous models that used P systems with active membranes for local search. The model contains two membranes, but the inclusion of several objects and rules within each membrane increases the parallelism and performance. This model reduces the number of communication rules required among membranes, and increases the execution speed. This model also increases the parallelism of previous P systems with active membranes when several rules evolve concurrently and more than one queen is exchanged during each step to reach a solution. Multi-core processing has been used to decrease the probability of restarting the P systems and to decrease processing time by distributing the processing of the active membrane on the multi-core. The speed of the proposed model when solving N= 200 queens was almost 1000 times faster than previous methods.

KW - Active membrane systems

KW - Local search

KW - Membrane computing

KW - Multi-core processing

KW - N-queens problem

UR - http://www.scopus.com/inward/record.url?scp=84910060608&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84910060608&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2014.05.004

DO - 10.1016/j.tcs.2014.05.004

M3 - Article

AN - SCOPUS:84910060608

VL - 551

SP - 39

EP - 54

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - C

ER -