Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
 
 
DownloadE-Mail
 Lokale TagsFreigabegeschichteDetailsÜbersicht
  Fast Concurrent Access to Parallel Disks

Sanders, P., Egner, S., & Korst, J. (2000). Fast Concurrent Access to Parallel Disks. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00) (pp. 849-858). New York, USA: ACM Press.

Item is

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-33AF-3 Versions-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-33B0-E
Genre: Konferenzbeitrag

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Sanders, Peter1, Autor           
Egner, Sebastian1, Autor           
Korst, Jan, Autor
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: High performance applications involving large data sets require the efficient and flexible use of multiple disks. In an external memory machine with $D$ parallel, independent disks, only one block can be accessed on each disk in one I/O step. This restriction leads to a load balancing problem that is perhaps the main inhibitor for adapting single-disk external memory algorithms to multiple disks. This paper shows that this problem can be solved efficiently using a combination of randomized placement, redundancy and an optimal scheduling algorithm. A buffer of $\Ohh{D}$ blocks suffices to support efficient writing of arbitrary blocks if blocks are distributed uniformly at random to the disks (e.g., by hashing). If two randomly allocated copies of each block exist, $N$ arbitrary blocks can be read within $\ceil{N/D}+1$ I/O steps with high probability. In addition, the redundancy can be reduced from $2$ to $1+1/r$ for any integer $r$. %Using appropriate codes even multiple disk %failures can be tolerated with low redundancy. These results can be used to emulate the simple and powerful ``single-disk multi-head'' model of external computing \cite{AggVit88} on the physically more realistic independent disk model \cite{VitShr94} with small constant overhead. This is faster than a lower bound for deterministic emulation \cite{Arm96}.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2010-03-022000
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: New York, USA : ACM Press
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: eDoc: 518110
Anderer: Local-ID: C1256428004B93B8-F6D0E56540A5201BC12569DD006CA6DB-SanEgnKor2000
 Art des Abschluß: -

Veranstaltung

einblenden:
ausblenden:
Titel: Untitled Event
Veranstaltungsort: San Francisco, USA
Start-/Enddatum: 2000

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00)
Genre der Quelle: Konferenzband
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: New York, USA : ACM Press
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: 849 - 858 Identifikator: ISBN: 0-89871-453-2