Affiliation:
1. Motorola Cambridge Research Center, Cambridge, MA
2. Duke Univ., Durham, NC
Abstract
We present an algorithm for sorting efficiently with parallel two-level memories. Our main result is an elegant, easy-to-implement, optimal,
deterministic
algorithm for external sorting with
D
disk drives. This result answers in the affirmative the open problem posed by Vitter and Shriver of whether an optimal algorithm exists that is deterministic. Our measure of performance is the number of parallel input/output (I/O) operations, in which each of the
D
disks can simultaneously transfer a block of
B
contiguous records. We assume that internal memory can hold
M
records. Our algorithm sorts
N
records in the optimal bound of θ((
N/BD
) log(
N/B
)/ log(
M/B
)) deterministically, and thus improves upon Vitter and Shriver's optimal randomized algorithm as well as the well-known deterministic but nonoptimal technique of disk striping. It is also practical to implement.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference15 articles.
1. ~AGGARWAI A. AND VITTER. J. S. 1988. The input/output complexity of sorting and related ~problems. Commun.4C3 I 31 9 (Sept.) pp. 1116-1127. 10.1145/48529.48535 ~AGGARWAI A. AND VITTER. J. S. 1988. The input/output complexity of sorting and related ~problems. Commun.4C3 I 31 9 (Sept.) pp. 1116-1127. 10.1145/48529.48535
2. A taxonomy of parallel sorting
3. Parallelism in tape-sorting
Cited by
45 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. I/O-Model;Encyclopedia of Algorithms;2016
2. External Sorting and Permuting;Encyclopedia of Algorithms;2016
3. I/O-Model;Encyclopedia of Algorithms;2015
4. External Sorting and Permuting;Encyclopedia of Algorithms;2015
5. Managing Quality of Probabilistic Databases;Handbook of Data Quality;2013