Menu
Home
Contact us
Stats
Categories
Calendar
Toggle Wiki
Wiki Home
Last Changes
Rankings
List pages
Orphan pages
Sandbox
Print
Toggle Image Galleries
Galleries
Rankings
Toggle Articles
Articles home
List articles
Rankings
Toggle Blogs
List blogs
Rankings
Toggle Forums
List forums
Rankings
Toggle File Galleries
List galleries
Rankings
Toggle Maps
Mapfiles
Toggle Surveys
List surveys
Stats
ITHEA Classification Structure > D. Software  > D.1 PROGRAMMING TECHNIQUES 
A CIRCUIT IMPLEMENTING MASSIVE PARALLELISM IN TRANSITION P SYSTEMS
By: Alonso et al. (4068 reads)
Rating: (1.00/10)

Abstract: Transition P-systems are based on biological membranes and try to emulate cell behavior and its evolution due to the presence of chemical elements. These systems perform computation through transition between two consecutive configurations, which consist in a m-tuple of multisets present at any moment in the existing m regions of the system. Transition between two configurations is performed by using evolution rules also present in each region. Among main Transition P-systems characteristics are massive parallelism and non determinism. This work is part of a very large project and tries to determine the design of a hardware circuit that can improve remarkably the process involved in the evolution of a membrane. Process in biological cells has two different levels of parallelism: the first one, obviously, is the evolution of each cell inside the whole set, and the second one is the application of the rules inside one membrane. This paper presents an evolution of the work done previously and includes an improvement that uses massive parallelism to do transition between two states. To achieve this, the initial set of rules is transformed into a new set that consists in all their possible combinations, and each of them is treated like a new rule (participant antecedents are added to generate a new multiset), converting an unique rule application in a way of parallelism in the means that several rules are applied at the same time. In this paper, we present a circuit that is able to process this kind of rules and to decode the result, taking advantage of all the potential that hardware has to implement P Systems versus previously proposed sequential solutions.

Keywords: Transition P System, membrane computing, circuit design.

ACM Classification Keywords: D.1.m Miscellaneous – Natural Computing

Link:

A CIRCUIT IMPLEMENTING MASSIVE PARALLELISM IN TRANSITION P SYSTEMS

Santiago Alonso, Luis Fernández, Fernando Arroyo, Javier Gil

http://www.foibg.com/ijitk/ijitk-vol02/ijitk02-1-p08.pdf

Print
D.1 PROGRAMMING TECHNIQUES
article: VARIETIES OF BIOLOGICAL INFORMATION: A MOLECULAR RECOGNITION APPROACH TO ... · ПРОБЛЕМЫ СОЗДАНИЯ ЖИЗНЕСПОСОБНЫХ ИНТЕЛЛЕК� · RESEARCHING FRAMEWORK FOR SIMULATING/IMPLEMENTATING P SYSTEMS · DELIMITED MASSIVELY PARALLEL ALGORITHM BASED ON RULES ELIMINATION · A CIRCUIT IMPLEMENTING MASSIVE PARALLELISM IN TRANSITION P SYSTEMS · A HIERARCHICAL ARCHITECTURE WITH PARALLEL COMUNICATION ... · ADVERGAMES: OVERVIEW · HW IMPLEMENTATION OF A OPTIMIZED ALGORITHM FOR THE APPLICATION ... · PROGRAMMING PARADIGMS IN COMPUTER SCIENCE EDUCATION ·
Login
[ register | I forgot my password ]
World Clock
Powered by Tikiwiki Powered by PHP Powered by Smarty Powered by ADOdb Made with CSS Powered by RDF powered by The PHP Layers Menu System
RSS Wiki RSS Blogs rss Articles RSS Image Galleries RSS File Galleries RSS Forums RSS Maps rss Calendars
[ Execution time: 0.08 secs ]   [ Memory usage: 7.52MB ]   [ GZIP Disabled ]   [ Server load: 0.45 ]
Powered by Tikiwiki CMS/Groupware