@Article{jadav:evaluation,
  author = {Divyesh Jadav and Chutimet Srinilta and Alok Choudhary and P. Bruce
  Berra},
  title = {An Evaluation of Design Tradeoffs in a High Performance
  Media-on-Demand Server},
  journal = {Multimedia Systems},
  year = {1997},
  month = {January},
  volume = {5},
  number = {1},
  pages = {53--68},
  URL = {http://www.cat.syr.edu/~divyesh/MMACM.ps},
  keywords = {parallel I/O, I/O scheduling, multimedia, video on demand,
  pario-bib},
  abstract = {One of the key components of a multi-user multimedia-on-demand
  system is the data server. Digitalization of traditionally analog data such
  as video and audio, and the feasibility of obtaining network bandwidths above
  the gigabit-per-second range are two important advances that have made
  possible the realization, in the near future, of interactive distributed
  multimedia systems. Secondary-to-main memory I/O technology has not kept pace
  with advances in networking, main memory and CPU processing power.
  Consequently, the performance of the server has a direct bearing on the
  overall performance of such a system. \par In this paper we present a
  high-performance solution to the I/O retrieval problem in a distributed
  multimedia system. Parallelism of data retrieval is achieved by striping the
  data across multiple disks. We identify the different components that
  contribute to media data retrieval delay. The variable delays among these
  have a great bearing on the server throughput under varying load conditions.
  We present a buffering scheme to minimize these variations. We have
  implemented our model on the Intel Paragon parallel computer. The results of
  component-wise instrumentation of the server operation are presented and
  analyzed. We present experimental results that demonstrate the efficacy of
  the buffering scheme. Based on our experiments, a dynamic admission control
  policy that takes server workload into account is proposed.},
  comment = {Much more detailed than jadav:media-on-demand. Here they present
  less survey information, and all the details on their Paragon
  implementation/simulation. They experiment with many tradeoffs, and propose
  and evaluate several scheduling and admission-control algorithms.}
}