ATTENTION: The software behind KU ScholarWorks is being upgraded to a new version. Starting July 15th, users will not be able to log in to the system, add items, nor make any changes until the new version is in place at the end of July. Searching for articles and opening files will continue to work while the system is being updated.
If you have any questions, please contact Marianne Reed at mreed@ku.edu .
Duality Between Prefetching and Queued Writing with Parallel Disks
dc.contributor.author | Hutchinson, David A. | |
dc.contributor.author | Sanders, Peter | |
dc.contributor.author | Vitter, Jeffrey Scott | |
dc.date.accessioned | 2015-11-20T17:32:31Z | |
dc.date.available | 2015-11-20T17:32:31Z | |
dc.date.issued | 2006-07-27 | |
dc.identifier.citation | 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 | en_US |
dc.identifier.uri | http://hdl.handle.net/1808/18955 | |
dc.description | This is the published version, made available with the permission of the publisher. Copyright © 2005 Society for Industrial and Applied Mathematics. | en_US |
dc.description.abstract | 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. | en_US |
dc.publisher | Society for Industrial and Applied Mathematics | en_US |
dc.subject | Caching | en_US |
dc.subject | External memory sorting | en_US |
dc.subject | Load balancing | en_US |
dc.subject | Lower bound | en_US |
dc.subject | Prefetching | en_US |
dc.subject | Randomized algorithm | en_US |
dc.title | Duality Between Prefetching and Queued Writing with Parallel Disks | en_US |
dc.type | Article | |
kusw.kuauthor | Vitter, Jeffrey Scott | |
kusw.kudepartment | Electrical Engr & Comp Science | en_US |
dc.identifier.doi | 10.1137/S0097539703431573 | |
kusw.oaversion | Scholarly/refereed, publisher version | |
kusw.oapolicy | This item does not meet KU Open Access policy criteria. | |
dc.rights.accessrights | openAccess |