Some parallel sorts on a mesh-connected processor array and their time efficiency
Journal of Parallel and Distributed Computing
The periodic balanced sorting network
Journal of the ACM (JACM)
Indexing functions and time lower bounds for sorting on a mesh-connected computer
Discrete Applied Mathematics
Parallel computing (2nd ed.): theory and practice
Parallel computing (2nd ed.): theory and practice
An optimal routing algorithm for mesh-connected Parallel computers
Journal of the ACM (JACM)
Journal of Computer and System Sciences
Sorting on a mesh-connected parallel computer
Communications of the ACM
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Sorting in Mesh Connected Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Implementing Bead-Sort with P Systems
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
The universality of various types of SIMD machine interconnection networks
ISCA '77 Proceedings of the 4th annual symposium on Computer architecture
Computer organization and algorithms for very-high speed computations.
Computer organization and algorithms for very-high speed computations.
Applications of Membrane Computing (Natural Computing Series)
Applications of Membrane Computing (Natural Computing Series)
Bitonic Sort on a Mesh-Connected Parallel Computer
IEEE Transactions on Computers
Parallel Processing with the Perfect Shuffle
IEEE Transactions on Computers
Sorting networks and their applications
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
On two-dimensional mesh networks and their simulation with p systems
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Implementing Sorting Networks with Spiking Neural P Systems
Fundamenta Informaticae
Computing the maximum bisimulation with spiking neural P systems
Computation, cooperation, and life
Implementing Sorting Networks with Spiking Neural P Systems
Fundamenta Informaticae
| Hi-index | 0.00 |
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.