de.mpg.escidoc.pubman.appbase.FacesBean
English

# Item

ITEM ACTIONSEXPORT

Released

Conference Paper

#### Asynchronous Scheduling of Redundant Disk Arrays

##### MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons45344

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

##### Locator
There are no locators available
##### Fulltext (public)
There are no public fulltexts available
##### Supplementary Material (public)
There is no public supplementary material available
##### Citation

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

Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-3389-8
##### Abstract
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.