Help Privacy Policy Disclaimer
  Advanced SearchBrowse




Conference Paper

Asynchronous Scheduling of Redundant Disk Arrays


Sanders,  Peter
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available

Sanders, P. (2000). Asynchronous Scheduling of Redundant Disk Arrays. In S.-H. Teng (Ed.), Proceedings of the 12th Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA-00) (pp. 89-98). New York, USA: ACM Press.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-3389-8
Random redundant allocation of data to parallel disk arrays can be exploited to achieve low access delays. New algorithms are proposed which improve the previously known shortest queue algorithm by systematically exploiting that scheduling decisions can be deferred until a block access is actually started on a disk. These algorithms are also generalized for coding schemes with low redundancy. Using extensive experiments, practically important quantities are measured which have so far eluded an analytical treatment: The delay distribution when a stream of requests approaches the limit of the sytem capacity, the system efficiency for parallel disk applications with bounded prefetching buffers, and the combination of both for mixed traffic. A further step towards practice is taken by outlining the system design for $\alpha$: automatically load-balanced parallel hard-disk array.