Comparing disk scheduling algorithms for VBR data streams

J.H.M. Korst, V. Pronk, P.F.A. Coumans, E.G.P. Doren, van, E.H.L. Aarts

Research output: Contribution to journalArticleAcademicpeer-review

6 Citations (Scopus)
1 Downloads (Pure)

Abstract

We compare a number of disk scheduling algorithms that can be used in a multimedia server for sustaining multiple variable-bit-rate (VBR) data streams. A data stream is sustained by repeatedly fetching a block of data from disk and storing it in a corresponding buffer. For each of the disk scheduling algorithms we give necessary and sufficient conditions for avoiding underflow and overflow of the buffers. In addition, the algorithms are compared with respect to buffer requirements as well as average response times.
Original languageEnglish
Pages (from-to)1328-1343
Number of pages16
JournalComputer Communications
Volume21
Issue number15
DOIs
Publication statusPublished - 1998

Fingerprint Dive into the research topics of 'Comparing disk scheduling algorithms for VBR data streams'. Together they form a unique fingerprint.

  • Cite this

    Korst, J. H. M., Pronk, V., Coumans, P. F. A., Doren, van, E. G. P., & Aarts, E. H. L. (1998). Comparing disk scheduling algorithms for VBR data streams. Computer Communications, 21(15), 1328-1343. https://doi.org/10.1016/S0140-3664(98)00201-1