A logarithmic time sort for linear size networks
Journal of the ACM (JACM)
An optimal sorting algorithm for mesh connected computers
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Optimal sorting on multi-dimensionally mesh-connected computers
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Optimal parallel merging and sorting without memory conflicts
IEEE Transactions on Computers
VLSI Algorithms and Architectures
Tight bounds on the complexity of parallel sorting
IEEE Transactions on Computers
Parallel Sorting in Two-Dimensional VLSI Models of Computation
IEEE Transactions on Computers
Deterministic sorting in nearly logarithmic time on the hypercube and related computers
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Randomized routing and sorting on fixed-connection networks
Journal of Algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
A New Network Topology with Multiple Meshes
IEEE Transactions on Computers
Parallel permutation and sorting algorithms and a new generalized connection network
Journal of the ACM (JACM)
Sorting on a mesh-connected parallel computer
Communications of the ACM
Sorting in Mesh Connected Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Multi-Mesh-an efficient topology for parallel processing
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Routing and Sorting on Mesh-Connected Arrays
AWOC '88 Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A New Network Topology with Multiple Meshes
IEEE Transactions on Computers
Parallel prefix computation on extended multi-mesh network
Information Processing Letters
Multi-mesh of trees with its parallel algorithms
Journal of Systems Architecture: the EUROMICRO Journal
Parallel algorithm for sorting on OTIS-ring multicomputer
Proceedings of the 2nd Bangalore Annual Compute Conference
A new scalable optimal topology for multi-hop optical networks
Computer Communications
Analysis of Multi-Sort Algorithm on Multi-Mesh of Trees (MMT) architecture
The Journal of Supercomputing
Comparison of SBA – family task allocation algorithms for mesh structured networks
ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
A new network topology with multiple three-dimensional meshes
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
Static and dynamic allocation algorithms in mesh structured networks
ICDCIT'06 Proceedings of the Third international conference on Distributed Computing and Internet Technology
On new architectures for lightwave networks
Computer Communications
Simulation-based evaluation of distributed mesh allocation algorithms
ISPA'07 Proceedings of the 2007 international conference on Frontiers of High Performance Computing and Networking
| Hi-index | 14.98 |
The shear-sort algorithm [19] on an SIMD mesh model requires $4\sqrt N+o\left( {\sqrt N} \right)$ time for sorting N elements arranged on a $\sqrt N\times \sqrt N$ mesh. In this paper, we present an algorithm for sorting N elements in time O(N1/4) on an SIMD Multi-Mesh architecture, thereby significantly improving the order of the time complexity. The Multi-Mesh architecture [23], [24] is built around n2 blocks, where each block is an n脳n mesh with n = N1/4, so that each processor will uniformly have four neighbors in the final topology.