English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Duality Between Prefetching and Queued Writing with Parallel Disks

Hutchinson, D. A., Sanders, P., & Vitter, J. S. (2001). Duality Between Prefetching and Queued Writing with Parallel Disks. In F. Meyer auf der Heide (Ed.), Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01) (pp. 62-73). Berlin, Germany: Springer.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3185-2 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3187-D
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Hutchinson, David A., Author
Sanders, Peter1, Author           
Vitter, Jeffrey Scott, Author
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 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 the integrated caching and prefetching problem, in which 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 merge sort, addressing a question that has been open for some time.

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-022001
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 518201
URI: http://www.mpi-sb.mpg.de/~sanders/papers/
Other: Local-ID: C1256428004B93B8-D5A21008571A6926C1256B4800520399-HutSanVit2001
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Aarhus, Denmark
Start-/End Date: 2001-08-28 - 2001-08-31

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01)
Source Genre: Proceedings
 Creator(s):
Meyer auf der Heide, Friedhelm, Editor
Affiliations:
-
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 62 - 73 Identifier: ISBN: 3-540-42493-8

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 2161 Sequence Number: - Start / End Page: - Identifier: -