Simulating the bitonic sort using P systems

TitleSimulating the bitonic sort using P systems
Publication TypeJournal Papers
Year of Publication2007
AuthorsCeterchi, R., Pérez-Jiménez M. J., & Tomescu A. I.
Journal TitleMembrane Computing, 8th International Workshop, WMC 2007
ISBN Number978-3-540-77311-5
Date PublishedJune 25-28

This paper gives a version of the parallel bitonic sorting algorithm of Batcher, which can sort N elements in time O(log2 N). We apply it to the 2D mesh architecture, using the shuffled row-major indexing function. A correctness proof of the proposed algorithm is given. Two simulations with P systems are introduced and discussed. The first one uses dynamic communication graphs and follows the guidelines of the mesh version of the algorithm. The second simulation requires only symbol rewriting rules in one membrane.


In G. Elefterakis, P. Kefalas, Gh. Paun, G. Rozenberg, A. Salomaa (eds.)