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

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer 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-2Engels
Pagina's (van-tot)1328-1343
Aantal pagina's16
TijdschriftComputer Communications
Volume21
Nummer van het tijdschrift15
DOI's
StatusGepubliceerd - 1998

Vingerafdruk Duik in de onderzoeksthema's van 'Comparing disk scheduling algorithms for VBR data streams'. Samen vormen ze een unieke vingerafdruk.

Citeer dit