Efficient PDM sorting algorithms

Authors:
Vamsi Kundeti;Sanguthevar Rajasekaran
Affiliations:
Department of Computer Science and Engineering, University of Connecticut, Storrs, CT;Department of Computer Science and Engineering, University of Connecticut, Storrs, CT
Venue:
HiPC'08 Proceedings of the 15th international conference on High performance computing
Year:
2008

Citing 13
Cited 1

The input/output complexity of sorting and related problems

Communications of the ACM
Deterministic distribution sort in shared and distributed memory multiprocessors

SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Greed sort: optimal deterministic sorting on parallel disks

Journal of the ACM (JACM)
Simple randomized mergesort on parallel disks

Parallel Computing - Special double issue: parallel I/O
Optimal parallel sorting in multi-level storage

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Fast concurrent access to parallel disks

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Distribution sort with randomized cycle

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract)

WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Asynchronous parallel disk sorting

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Advanced Programming in the UNIX(R) Environment (2nd Edition)

Advanced Programming in the UNIX(R) Environment (2nd Edition)
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
Optimal and Practical Algorithms for Sorting on the PDM

IEEE Transactions on Computers
A simple optimal randomized algorithm for sorting on the PDM

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

Efficient out-of-core sorting algorithms for the Parallel Disks Model

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present efficient algorithms for sorting onthe The Parallel Disks Model (PDM). Numerous asymptotically optimalalgorithms have been proposed in the literature. However many of themhave large underlying constants in the time bounds. We present practicaland optimal algorithms in this paper. We have implemented thesealgorithms and evaluated their performance. Experimental data are verypromising.