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

Algorithms

Onderzoeksoutput: Bijdrage aan tijdschrift › Tijdschriftartikel › Academic › peer review

6 Citaten (Scopus)

1 Downloads (Pure)

Samenvatting

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.

Originele taal-2	Engels
Pagina's (van-tot)	1328-1343
Aantal pagina's	16
Tijdschrift	Computer Communications
Volume	21
Nummer van het tijdschrift	15
DOI's	https://doi.org/10.1016/S0140-3664(98)00201-1
Status	Gepubliceerd - 1998

Toegang tot document

10.1016/S0140-3664(98)00201-1

Citeer dit

@article{aaea28f7dab341baa4329fa8a27fee37,

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

issn = "0140-3664",

publisher = "Elsevier",

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 Communications

JF - Computer Communications

IS - 15

ER -

Comparing disk scheduling algorithms for VBR data streams

Samenvatting

Toegang tot document

Vingerafdruk

Citeer dit