Repositorio de producción científica de la Universidad de Sevilla

Sorting Omega Networks Simulated with P Systems: Optimal Data Layouts

 

Advanced Search
 
Opened Access Sorting Omega Networks Simulated with P Systems: Optimal Data Layouts
Cites
Show item statistics
Icon
Export to
Author: Ceterchi, Rodica
Pérez Jiménez, Mario de Jesús
Tomescu, Alexandru Ioan
Department: Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
Date: 2008
Published in: CBM 2008: International Workshop on Computing with Biomolecules (2008), p 29-42
ISBN/ISSN: 978-3-85403-244-1
Document type: Presentation
Abstract: The paper introduces some sorting networks and their simulation with P systems, in which each processor/membrane can hold more than one piece of data, and perform operations on them internally. Several data layouts are discussed in this context, and an optimal one is proposed, together with its implementation as a P system with dynamic communication graphs.
Cite: Ceterchi, R., Pérez Jiménez, M.d.J. y Tomescu, A.I. (2008). Sorting Omega Networks Simulated with P Systems: Optimal Data Layouts. En CBM 2008: International Workshop on Computing with Biomolecules (29-42), Wien, Austria: Österreichische Computer Gesellschaft Komitee für Öffentlichkeitsarbeit.
Size: 368.8Kb
Format: PDF

URI: http://hdl.handle.net/11441/68018

See editor´s version

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)