An AT2 Optimal Mapping of Sorting onto the Mesh Connected Array without Comparators

Authors:
Affiliations:
Venue:
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Year:
1998

Citing 5
Cited 0

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
An optimal sorting algorithm on reconfigurable mesh

Journal of Parallel and Distributed Computing
Sorting on a mesh-connected parallel computer

Communications of the ACM
Computational Aspects of VLSI

Computational Aspects of VLSI

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a parallel SIMD algorithm for sorting of N numbers of log N bits each on a mesh connected array without comparators. While most previous AT2-optimal sorting algorithms on the mesh explicitly or implicitly assume O(1) time comparison of two operands of O(1og N) bits, our algorithm does not require O(1) time comparison. Rather we assume O(log N) time comparison, which makes our algorithm realizable with current VLSI technology. To retain the AT2 optimality with increased (by a factor of O(log N)) comparison time, we develop a new mapping technique which combines radix sort, shear sort, block merge and column sort in a creative way. The time complexity of sorting of N numbers on a (two-dimensional) mesh of size N1/2 脳 N1/2 without comparotors is O(N1/2).