Simulating the bitonic sort using P systems | Research Group on Natural Computing

Title	Simulating the bitonic sort using P systems
Publication Type	Journal Papers
Year of Publication	2007
Authors	Ceterchi, R., Pérez-Jiménez M. J., & Tomescu A. I.
Journal Title	Membrane Computing, 8th International Workshop, WMC 2007
ISBN Number	978-3-540-77311-5
Volume	486
Pages	172-192
Date Published	June 25-28
Abstract	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.
URL	http://www.springerlink.com/content/x451465201253846/
Notes	In G. Elefterakis, P. Kefalas, Gh. Paun, G. Rozenberg, A. Salomaa (eds.)
DOI	10.1007/978-3-540-77312-2