Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
 
 
DownloadE-Mail
 Lokale TagsFreigabegeschichteDetailsÜbersicht
  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

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3185-2 Versions-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3187-D
Genre: Konferenzbeitrag

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Hutchinson, David A., Autor
Sanders, Peter1, Autor           
Vitter, Jeffrey Scott, Autor
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: 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

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2010-03-022001
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: eDoc: 518201
URI: http://www.mpi-sb.mpg.de/~sanders/papers/
Anderer: Local-ID: C1256428004B93B8-D5A21008571A6926C1256B4800520399-HutSanVit2001
 Art des Abschluß: -

Veranstaltung

einblenden:
ausblenden:
Titel: Untitled Event
Veranstaltungsort: Aarhus, Denmark
Start-/Enddatum: 2001-08-28 - 2001-08-31

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01)
Genre der Quelle: Konferenzband
 Urheber:
Meyer auf der Heide, Friedhelm, Herausgeber
Affiliations:
-
Ort, Verlag, Ausgabe: Berlin, Germany : Springer
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: 62 - 73 Identifikator: ISBN: 3-540-42493-8

Quelle 2

einblenden:
ausblenden:
Titel: Lecture Notes in Computer Science
Genre der Quelle: Reihe
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: -
Seiten: - Band / Heft: 2161 Artikelnummer: - Start- / Endseite: - Identifikator: -