Thumbnail
Access Restriction
Subscribed

Author Nodine, Mark H. ♦ Vitter, Jeffrey Scott
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1995
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword I/O complexity ♦ Merge sort ♦ Parallel I/O ♦ Parallel disks
Abstract We present an algorithm for sorting efficiently with parallel two-level memories. Our main result is an elegant, easy-to-implement, optimal, $\textit{deterministic}$ algorithm for external sorting with $\textit{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 $\textit{D}$ disks can simultaneously transfer a block of $\textit{B}$ contiguous records. We assume that internal memory can hold $\textit{M}$ records. Our algorithm sorts $\textit{N}$ records in the optimal bound of $&thgr;((\textit{N/BD})$ $log(\textit{N/B})/$ $log(\textit{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.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1995-07-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 42
Issue Number 4
Page Count 15
Starting Page 919
Ending Page 933


Open content in new tab

   Open content in new tab
Source: ACM Digital Library