An Efficient General In-Place Parallel Sorting Scheme

Authors:
S. Q. Zheng;Balaji Calidas;Yanjun Zhang
Affiliations:
Department of Computer Science, University of Texas at Dallas, Richardson, TX 75083, USA;Department of Electrical and Computer Engineering, Louisiana State University, Baton Rouge, LA 70803, USA;Department of Computer Science and Engineering, Southern Methodist University, Dallas, TX 75275, USA
Venue:
The Journal of Supercomputing
Year:
1999

Citing 11
Cited 1

Min-max heaps and generalized priority queues

Communications of the ACM
Reevaluating Amdahl's law

Communications of the ACM
Polymorphic-Torus Network

IEEE Transactions on Computers
Time-Space Optimal Parallel Merging and Sorting

IEEE Transactions on Computers
Scalable problems and memory-bounded speedup

Journal of Parallel and Distributed Computing
A novel deterministic sampling scheme with applications to broadcast-efficient sorting on the reconfigurable mesh

Journal of Parallel and Distributed Computing
Parallel stereocorrelation on a reconfigurable multi-ring network

The Journal of Supercomputing - Special issue on parallel and distributed processing
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Advanced Computer Architecture: Parallelism,Scalability,Programmability

Advanced Computer Architecture: Parallelism,Scalability,Programmability
An Optimal Sorting Algorithm on Reconfigurable Mesh

IPPS '92 Proceedings of the 6th International Parallel Processing Symposium
Design and analysis of a systolic sorting architecture

SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing

Library support for parallel sorting in scientific computations

Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a simple and general parallel sorting scheme, ZZ-sort, which can be used to derive a class of efficient in-place sorting algorithms on realistic parallel machine models. We prove a tight bound for the worst case performance of ZZ-sort. We also demonstrate the average performance of ZZ-sort by experimental results obtained on a MasPar parallel computer. Our experiments indicate that ZZ-sort can be incorporated into a distributed memory parallel computer system as a standard routine, and this routine is useful for space critical situations. Finally, we show that ZZ-sort can be used to convert a non-adaptive parallel sorting algorithm into an in-place and adaptive one by considering the problem of sorting an arbitrarily large input on fixed-size reconfigurable meshes.