Merging and Sorting Networks with the Topology of the Omega Network
IEEE Transactions on Computers
The periodic balanced sorting network
Journal of the ACM (JACM)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Optimizing Parallel Bitonic Sort
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
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
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Tight bounds on the complexity of parallel sorting
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Improved Sorting Networks with O(log n) Depth
Improved Sorting Networks with O(log n) Depth
Optimizing Parallel Bitonic Sort
Optimizing Parallel Bitonic Sort
Fundamenta Informaticae
Sorting networks and their applications
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
Simulating the bitonic sort using P systems
WMC'07 Proceedings of the 8th international conference on Membrane computing
Solving numerical NP-complete problems with spiking neural P systems
WMC'07 Proceedings of the 8th international conference on Membrane computing
Computing with spiking neural p systems: traces and small universal systems
DNA'06 Proceedings of the 12th international conference on DNA Computing
Computing the maximum bisimulation with spiking neural P systems
Computation, cooperation, and life
Evolutionary design of a simple membrane system
CMC'11 Proceedings of the 12th international conference on Membrane Computing
| Hi-index | 0.00 |
Spiking neural P systems simulate the behavior of neurons sending signals through axons. Recently, some applications concerning Boolean circuits and sorting algorithms have been proposed. In this paper, we study the ability of such systems to simulate a well known parallel sorting model, sorting networks. First, we construct spiking neural P systems which act as comparators of two values, and then show how to assemble these building blocks according to the topology of a sorting network of N values. In the second part of the paper, we formalize a framework to transform any sorting network into a network composed of comparators which sort n values, 2