@InProceedings{freedman:video,
  author = {Craig S. Freedman and David J. DeWitt},
  title = {The {SPIFFI} Scalable Video-on-Demand System},
  booktitle = {Proceedings of the ACM SIGMOD International Conference on
  Management of Data},
  year = {1995},
  pages = {352--363},
  publisher = {ACM Press},
  keywords = {parallel file system, multimedia, video server, pario-bib},
  comment = {See also freedman:spiffi. They simulate their video-on-demand
  server. Their model is a cluster of workstation servers, connected by a
  network to video-display terminals. The terminals just have a circular buffer
  queue that they fill by making requests to the server, and drain by
  uncompressing MPEG and displaying video. The servers manage a buffer pool and
  a set of striped disks. All videos are striped across all disks. They use
  dual LRU lists in the server buffer pool: one for used blocks, and one for
  prefetched blocks (``love prefetching''). They use a ``real-time'' disk
  scheduling algorithm that prioritizes requests by their deadlines (or
  anticipated deadline in case of a prefetch). Their metric is maximum number
  of terminals that can be supported without glitches. They plan to implement
  their system on a workstation cluster.}
}