Comparing disk scheduling algorithms for VBR data streams

  • Authors:
  • Jan Korst;Verus Pronk;Pascal Coumans;Giel Van Doren;Emile Aarts

  • Affiliations:
  • Philips Research Laboratories, Prof. Holstlaan 4, 5656 AA Eindhoven, The Netherlands;Philips Research Laboratories, Prof. Holstlaan 4, 5656 AA Eindhoven, The Netherlands;Philips Research Laboratories, Prof. Holstlaan 4, 5656 AA Eindhoven, The Netherlands;Philips Research Laboratories, Prof. Holstlaan 4, 5656 AA Eindhoven, The Netherlands;Philips Research Laboratories, Prof. Holstlaan 4, 5656 AA Eindhoven, The Netherlands and Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

  • Venue:
  • Computer Communications
  • Year:
  • 1998

Quantified Score

Hi-index 0.25

Visualization

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.