@InProceedings{jadav:ioschedule,
  author = {Divyesh Jadav and Chutimet Srinilta and Alok Choudhary and P. Bruce
  Berra},
  title = {Design and Evaluation of Data Access Strategies in a High
  Performance Multimedia-on-Demand Server},
  booktitle = {Proceedings of the Second IEEE International Conference on
  Multimedia Computing and Systems},
  year = {1995},
  month = {May},
  pages = {286--291},
  later = {jadav:j-ioschedule},
  URL = {http://www.cat.syr.edu/~divyesh/ICMCS95.ps},
  keywords = {parallel I/O, multimedia, pario-bib},
  abstract = {One of the key components of a multi user multimedia on demand
  system is the data server. Digitization 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. We develop a model for the architecture
  of a server for such a system. Parallelism of data retrieval is achieved by
  striping the data across multiple disks. The performance of any server
  ultimately depends on the data access patterns. Two modifications of the
  basic retrieval algorithm are presented to exploit data access patterns in
  order to improve system throughput and response time. A complementary
  information caching optimization is discussed. Finally, we present
  performance results of these algorithms on the IBM SP1 and Intel Paragon
  parallel computers.},
  comment = {Journal version is jadav:j-ioschedule? See also
  jadav:media-on-demand. [Comments based on a much earlier version.] They
  propose I/O scheduling algorithms for multimedia file servers. They assume an
  MIMD architecture with no shared memory and with a disk on every node. One
  node is essentially a manager for new requests. Another set are interface
  nodes, each managing the data flow for a few multimedia data streams. The
  majority are server nodes, responsible just for fetching their data from disk
  and sending it to the interface nodes. The interface nodes assemble data from
  the server nodes into a data stream, and send it on out to the client. They
  describe algorithms for scheduling requests from the interface node to the
  server node, and for sending data out to the client. They also describe an
  algorithm for determining whether the system can accept a new request.}
}