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

Sorting Omega Networks Simulated with P Systems: Optimal Data Layouts

Opened Access Sorting Omega Networks Simulated with P Systems: Optimal Data Layouts
Estadísticas
Icon
Exportar a
Autor: Ceterchi, Rodica
Pérez Jiménez, Mario de Jesús
Tomescu, Alexandru Ioan
Departamento: Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
Fecha: 2008
Publicado en: CBM 2008: International Workshop on Computing with Biomolecules (2008), p 29-42
ISBN/ISSN: 978-3-85403-244-1
Tipo de documento: Ponencia
Resumen: 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.
Cita: 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.
Tamaño: 368.8Kb
Formato: PDF

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

Ver versión del editor

Mostrar el registro completo del ítem


Esta obra está bajo una Licencia Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internacional

Este registro aparece en las siguientes colecciones