%0 Generic
%D 2007
%T Simulating the bitonic sort using P systems
%A Rodica Ceterchi
%A Mario J. Pérez-Jiménez
%A Alexandru I. Tomescu
%P 172-192
%R 10.1007/978-3-540-77312-2
%U http://www.springerlink.com/content/x451465201253846/
%V 486
%X 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.
%Z In G. Elefterakis, P. Kefalas, Gh. Paun, G. Rozenberg, A. Salomaa (eds.)
%8 June 25-28
%@ 978-3-540-77311-5