The input/output complexity of sorting and related problems
Communications of the ACM
Tight bounds on the complexity of parallel sorting
IEEE Transactions on Computers
Large-scale sorting in parallel memories (extended abstract)
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Markov analysis of multiple-disk prefetching strategies for external merging
Theoretical Computer Science - Special issue on dependable parallel computing
Greed sort: optimal deterministic sorting on parallel disks
Journal of the ACM (JACM)
Approximate medians and other quantiles in one pass and with limited memory
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
A framework for simple sorting algorithms on parallel disk systems (extended abstract)
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Optimal parallel sorting in multi-level storage
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Sorting on a mesh-connected parallel computer
Communications of the ACM
Expected time bounds for selection
Communications of the ACM
Computer Algorithms: C++
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
Selection Algorithms for Parallel Disk Systems
HIPC '98 Proceedings of the Fifth International Conference on High Performance Computing
Fast Out-of-Core Sorting on Parallel Disk Systems
Fast Out-of-Core Sorting on Parallel Disk Systems
Simple Randomized Mergesort on Parallel Disks
Simple Randomized Mergesort on Parallel Disks
| Hi-index | 0.00 |
Data explosion is an increasingly prevalent problem in every field of science. Traditional out-of-core models that assume a single disk have been found inadequate to handle voluminous data. As a result, models that employ multiple disks have been proposed in the literature. For example, the Parallel Disk Systems (PDS) model assumes D disks and a single computer. It is also assumed that a block of data from each of the D disks can be fetched into the main memory in one parallel I/O operation.In this article, we survey sorting and selection algorithms that have been devised for out-of-core models assuming multiple disks. We also consider practical implementations of parallel disk models.