An optimal sorting algorithm for mesh connected computers
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Lower bounds for sorting on mesh-connected architectures
Acta Informatica
Optimal sorting on multi-dimensionally mesh-connected computers
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
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
Sorting on a ring of processors
Journal of Algorithms
Average case analysis of greedy routing algorithms on arrays
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
A unified algorithm for sorting on multidimensional mesh-connected processors
Information Processing Letters
Randomized sorting and selection on mesh-connected processor arrays (preliminary version)
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Concentrated regular data streams on grids: sorting and routing near to the bisection bound
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Learning monotone Boolean functions by uniformly distributed examples
SIAM Journal on Computing
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Parallel Sorting Algorithms
Sorting within Distance Bound on a Mesh-Connected Processor Array
Proceedings of the International Symposium on Optimal Algorithms
Sorting within Distance Bound on a Mesh-Connected Processor Array
Proceedings of the International Symposium on Optimal Algorithms
A minimum area VLSI network for O(logn) time 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
Computational Aspects of VLSI
Two Packet Routing Algorithms on a Mesh-Connected Computer
IEEE Transactions on Parallel and Distributed Systems
Reconfigurable Parallel Sorting and Load Balancing on a Beowulf Cluster: HeteroSort
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Merging, sorting and matrix operations on the SOME-bus multiprocessor architecture
Future Generation Computer Systems - Special issue: Advanced services for clusters and internet computing
PDM Sorting Algorithms That Take A Small Number of Passes
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
A generalization of the 0-1 principle for sorting
Information Processing Letters
A generalization of the 0--1 principle for sorting
Information Processing Letters
It’s elementary, my dear watson: time-optimal sorting algorithms on a completely overlapping network
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
| Hi-index | 0.00 |
We give three new parallel sorting algorithms on a mesh-connected computer withwraparound connections (i.e. a torus). These three algorithms, with the minimum queuesize of 1, sort n/sup 2/ random input data items into a blocked snakelike row major order,a row major order, and a snakelike row major order, in 1.5n+o(n), 2n+o(n), and 2n+o(n)average steps, respectively. These results improve the previous results of 2n+o(n),2.5n+o(n), and 2.5n+o(n), respectively. In addition, we prove that the distance bound non a torus is an average-time lower bound independent of indexing schemes of sortingrandom input data items on it.