Duality Between Prefetching and Queued Writing with Parallel Disks
Hutchinson, David A.
Vitter, Jeffrey Scott
Society for Industrial and Applied Mathematics
Scholarly/refereed, publisher version
MetadataShow full item record
Parallel disks promise to be a cost effective means for achieving high bandwidth in applications involving massive data sets, but algorithms for parallel disks can be difficult to devise. To combat this problem, we define a useful and natural duality between writing to parallel disks and the seemingly more difficult problem of prefetching. We first explore this duality for applications involving read-once accesses using parallel disks. We get a simple linear time algorithm for computing optimal prefetch schedules and analyze the efficiency of the resulting schedules for randomly placed data and for arbitrary interleaved accesses to striped sequences. Duality also provides an optimal schedule for prefetching plus caching, where blocks can be accessed multiple times. Another application of this duality gives us the first parallel disk sorting algorithms that are provably optimal up to lower-order terms. One of these algorithms is a simple and practical variant of multiway mergesort, addressing a question that had been open for some time.
This is the published version, made available with the permission of the publisher. Copyright © 2005 Society for Industrial and Applied Mathematics.
Hutchinson, David A., Peter Sanders, and Jeffrey Scott Vitter. "Duality Between Prefetching and Queued Writing with Parallel Disks." SIAM J. Comput. SIAM Journal on Computing 34.6 (2005): 1443-463. DOI:10.1137/S0097539703431573
Items in KU ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
We want to hear from you! Please share your stories about how Open Access to this item benefits YOU.