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

doi:10.1016/S0140-3664(98)00201-1

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 journal › Article › Scientific › peer-review

6 Citations (Scopus)

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 language	English
Pages (from-to)	1328-1343
Number of pages	16
Journal	Computer Physics Communications
Volume	21
Issue number	15
DOIs	https://doi.org/10.1016/S0140-3664(98)00201-1
Publication status	Published - 1998
Externally published	Yes

Access to Document

10.1016/S0140-3664(98)00201-1

Cite this

@article{84842941837342608d6b7854fd0016ec,

title = "Comparing disk scheduling algorithms for VBR data streams",

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.",

author = "J.H.M. Korst and V. Pronk and P.F.A. Coumans and {Doren van}, E.G.P. and E.H.L. Aarts",

year = "1998",

doi = "10.1016/S0140-3664(98)00201-1",

language = "English",

volume = "21",

pages = "1328--1343",

journal = "Computer Physics Communications",

issn = "0140-3664",

publisher = "Elsevier B.V.",

number = "15",

}

TY - JOUR

T1 - Comparing disk scheduling algorithms for VBR data streams

AU - Korst, J.H.M.

AU - Pronk, V.

AU - Coumans, P.F.A.

AU - Doren van, E.G.P.

AU - Aarts, E.H.L.

PY - 1998

Y1 - 1998

N2 - 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.

AB - 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.

U2 - 10.1016/S0140-3664(98)00201-1

DO - 10.1016/S0140-3664(98)00201-1

M3 - Article

SN - 0140-3664

VL - 21

SP - 1328

EP - 1343

JO - Computer Physics Communications

JF - Computer Physics Communications

IS - 15

ER -

Comparing disk scheduling algorithms for VBR data streams

Abstract

Access to Document

Fingerprint

Cite this