Presentation
Sorting Omega Networks Simulated with P Systems: Optimal Data Layouts
Author/s | 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 |
Publication Date | 2008 |
Deposit Date | 2017-12-27 |
Published in |
|
ISBN/ISSN | 978-3-85403-244-1 |
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 ... 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. |
Citation | 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. |
Files | Size | Format | View | Description |
---|---|---|---|---|
dl-ps-4a.pdf | 368.8Kb | [PDF] | View/ | |