Improved sorting algorithms for parallel computers

Authors:
Arvin Park;K. Balasubramanian
Affiliations:
Department Computer Science, Princeton University, Princeton, New Jersey;Department Computer Science, Princeton University, Princeton, New Jersey
Venue:
CSC '87 Proceedings of the 15th annual conference on Computer Science
Year:
1987

Citing 3
Cited 1

The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Sorting on a mesh-connected parallel computer

Communications of the ACM
Architecture of the PSC-a programmable systolic chip

ISCA '83 Proceedings of the 10th annual international symposium on Computer architecture

Sorting n2 Numbers on n x n Meshes

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We make observations that improve processor utilization and decrease communication overhead for several parallel sorting algorithms. These lead to constant factor improvements on the best previous parallel sorting bounds for both mesh-connected and linearly connected parallel architectures [2,12] (Previous bounds were within a constant factor of optimal.). These improved bounds are achieved using fewer processors with greater processor utilization.