Home News About Us Contact Contributors Disclaimer Help FAQ

Home
Search
Quick Search
Advanced
Fulltext
Browse
Collections
Persons
My eDoc
Session History
Login
Name:
Password:
Documentation
Help
Support Wiki
Direct access to
document ID:


          Display Documents



ID: 518201.0, MPI für Informatik / Algorithms and Complexity Group
Duality Between Prefetching and Queued Writing with Parallel Disks
Authors:Hutchinson, David A.; Sanders, Peter; Vitter, Jeffrey Scott
Language:English
Publisher:Springer
Place of Publication:Berlin, Germany
Date of Publication (YYYY-MM-DD):2001
Title of Proceedings:Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01)
Start Page:62
End Page:73
Title of Series:Lecture Notes in Computer Science
Place of Conference/Meeting:Aarhus, Denmark
(Start) Date of Conference/Meeting
 (YYYY-MM-DD):
2001-08-28
End Date of Conference/Meeting 
 (YYYY-MM-DD):
2001-08-31
Audience:Experts Only
Intended Educational Use:No
Abstract / Description: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.
Last Change of the Resource (YYYY-MM-DD):2010-03-02
External Publication Status:published
Document Type:Conference-Paper
Communicated by:Kurt Mehlhorn
Affiliations:MPI für Informatik/Algorithms and Complexity Group
Identifiers:LOCALID:C1256428004B93B8-D5A21008571A6926C1256B4800520399-...
URL:http://www.mpi-sb.mpg.de/~sanders/papers/
ISBN:3-540-42493-8
The scope and number of records on eDoc is subject to the collection policies defined by each institute - see "info" button in the collection browse view.