Fast Concurrent Access to Parallel Disks

Fast Concurrent Access to Parallel Disks (1999)

Cached

Download Links

[www.mpi-sb.mpg.de]
[www.mpi-sb.mpg.de]

Other Repositories/Bibliography

DBLP

by Peter Sanders , Sebastian Egner , Jan Korst

Venue:	In 11th ACM-SIAM Symposium on Discrete Algorithms
Citations:	44 - 11 self

Versions

Version History

Metadata Version 2

Datum	Value	Source
TITLE	Fast concurrent access to parallel disks	INFERENCE
AUTHOR NAME	Peter Sanders	SVM HeaderParse 0.1
AUTHOR AFFIL	, Sebastian Egner and Jan Korst; y	SVM HeaderParse 0.2
ABSTRACT	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 O(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 dN=De + 1 I/O steps with high probability. In addition, the redundancy can be reduced from 2 to 1 + 1=r for any integer r. These results can be used to emulate the simple and powerful "single-disk multi-head " model of external computing [1] on the physically more realistic independent disk model [33] with small constant overhead. This is faster than a lower bound for deterministic emulation [3].	SVM HeaderParse 0.1
YEAR	2000	INFERENCE
VENUE	In 11th ACM-SIAM Symposium on Discrete Algorithms	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	849--858	INFERENCE
CITATIONS	34 found	ParsCit 1.0