Two nearly optimal sorting algorithms for mesh-connected processor arrays using shear-sort
Journal Article
·
· Journal of Parallel and Distributed Computing; (USA)
- California Univ., Santa Barbara, CA (USA). Dept. of Electrical and Computer Engineering
The recently discovered Shear-sort algorithm requires log/sub 2/n iterations of row and column sorts for ordering n/sup 2/ elements on an n x n mesh-connected array of processors. Although the method is extremely simple and practical, it falls short by a factor of log/sub 2/n of the well-known lower bound for sorting on a mesh-connected computer. Recursive application of Shear-sort in a square array leads to the first O(n) algorithm proposed by the authors. A slightly more complicated iterative algorithm, also executing in O(n) steps is presented next. Both algorithms are simple and are the result of the adoption of an entirely new approach to two-dimensional sorting.
- OSTI ID:
- 5145334
- Journal Information:
- Journal of Parallel and Distributed Computing; (USA), Journal Name: Journal of Parallel and Distributed Computing; (USA) Vol. 6:1; ISSN 0743-7315; ISSN JPDCE
- Country of Publication:
- United States
- Language:
- English
Similar Records
Some parallel sorts on a mesh-connected processor array and their time efficiency
Efficient implementation of Batcher's odd-even merge algorithm and its application in parallel sorting schemes
Parallel sorting in a ring network of processors
Journal Article
·
Mon Sep 01 00:00:00 EDT 1986
· J. Parallel Distrib. Comput.; (United States)
·
OSTI ID:6849179
Efficient implementation of Batcher's odd-even merge algorithm and its application in parallel sorting schemes
Journal Article
·
Mon Feb 28 23:00:00 EST 1983
· IEEE Trans. Comput.; (United States)
·
OSTI ID:5140174
Parallel sorting in a ring network of processors
Journal Article
·
Tue Feb 28 23:00:00 EST 1989
· IEEE Trans. Comput.; (United States)
·
OSTI ID:6243196