@Article{sanders:jasync,
  author = {Peter Sanders},
  title = {Asynchronous Scheduling of Redundant Disk Arrays},
  journal = {IEEE Transactions on Computers},
  year = {2003},
  month = {September},
  volume = {52},
  number = {9},
  pages = {1170--1184},
  institution = {Max Planck Inst Comp Sci, Stuhlsatzenhausweg 85, D-66123
  Saarbrucken, Germany; Max Planck Inst Comp Sci, D-66123 Saarbrucken,
  Germany},
  publisher = {IEEE Computer Society Press},
  URL = {http://csdl.computer.org/dl/trans/tc/2003/09/t1170.pdf},
  keywords = {parallel disks, lazy scheduling, random redundant storage, I/O
  algorithm, random block placement, bipartite matching, pario-bib},
  abstract = {Allocation of data to a parallel disk using redundant storage and
  random placement of blocks can be exploited to achieve low access delays. New
  algorithms are proposed which improve the previously known shortest queue
  algorithm by systematically exploiting the fact 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 simulations, 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 toward practice
  is taken by outlining the system design for a.: automatically load-balanced
  parallel hard-disk array. Additional algorithmic measures are proposed for a
  that allow variable sized blocks, seek time reduction, fault tolerance,
  inhomogeneous systems, and flexible priorization schemes. (41 refs.)}
}