147 research outputs found
Simulating the Bitonic Sort on a 2D-mesh with P Systems
This paper gives a version of the parallel bitonic sorting algorithm of
Batcher, which can sort N elements in time O(log2 N). When applying it to the 2D
mesh architecture, two indexing functions are considered, row-major and shuffled row-
major. Some properties are proved for the later, together with a correctness proof of
the proposed algorithm. Two simulations with P systems are proposed 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
A Biological Perspective on Sorting with P Systems
The aim of this contribution is to argue that the processes occurring in biological
membranes in bacteria are also important as natural examples of communication
between membranes, which, in the formal framework of P systems, leads (among other
things) to simulations of sorting operations
Sorting Omega Networks Simulated with P Systems: Optimal Data Layouts
The paper introduces some sorting networks and their simulation with P
systems, in which each processor/membrane can hold more than one piece of data, and
perform operations on them internally. Several data layouts are discussed in this context,
and an optimal one is proposed, together with its implementation as a P system with
dynamic communication graphs
A taxonomy of parallel sorting
TR 84-601In this paper, we propose a taxonomy of parallel sorting that includes a broad range of array
and file sorting algorithms. We analyze the evolution of research on parallel sorting, from the
earliest sorting networks to the shared memory algorithms and the VLSI sorters. In the context
of sorting networks, we describe two fundamental parallel merging schemes - the odd-even and
the bitonic merge. Sorting algorithms have been derived from these merging algorithms for parallel
computers where processors communicate through interconnection networks such as the perfect
shuffle, the mesh and a number of other sparse networks. After describing the network sorting
algorithms, we show that, with a shared memory model of parallel computation, faster algorithms
have been derived from parallel enumeration sorting schemes, where keys are first ranked and
then rearranged according to their rank
- …