@InProceedings{sanders:async,
  author = {Peter Sanders},
  title = {Asynchronous scheduling of redundant disk arrays.},
  booktitle = {Twelfth ACM Symposium on Parallel Algorithms and Architectures},
  year = {2000},
  month = {July},
  pages = {89--98},
  publisher = {ACM Press},
  copyright = {(c)2004 IEE},
  address = {Bar Harbour, MN, USA},
  later = {#sanders:jasync#},
  keywords = {parallel disks, lazy scheduling, random redundant storage, I/O
  algorithm, random block placement, bipartite matching, pario-bib},
  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 system 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. (31 refs.)},
  comment = {Also see later version sanders:jasync.}
}