Periodic scheduling in a multimedia server

J.H.M. Korst, V. Pronk, E.H.L. Aarts, F.J.G. Lamerikx

Research output: Other contributionOther research output

Abstract

We describe how the problem of effectively servicing a number of users by a multimedia server can be represented as a periodic disk scheduling problem. We give an overview of related work and present a number of new results, based on periodically servicing users that have different consumption requirements with different periods. In addition, by scheduling sets of disk accesses as batches the worst-case switching overhead is reduced
Original languageEnglish
Number of pages12
DOIs
Publication statusPublished - 1995
Externally publishedYes

Fingerprint

Servers
Scheduling

Cite this

Korst, J.H.M. ; Pronk, V. ; Aarts, E.H.L. ; Lamerikx, F.J.G. / Periodic scheduling in a multimedia server. 1995. 12 p.
@misc{f7a53c4ac6854e12a32bfd6799188adc,
title = "Periodic scheduling in a multimedia server",
abstract = "We describe how the problem of effectively servicing a number of users by a multimedia server can be represented as a periodic disk scheduling problem. We give an overview of related work and present a number of new results, based on periodically servicing users that have different consumption requirements with different periods. In addition, by scheduling sets of disk accesses as batches the worst-case switching overhead is reduced",
author = "J.H.M. Korst and V. Pronk and E.H.L. Aarts and F.J.G. Lamerikx",
year = "1995",
doi = "10.1109/ETFA.1995.496775",
language = "English",
isbn = "0-7803-2535-4",
type = "Other",

}

Periodic scheduling in a multimedia server. / Korst, J.H.M.; Pronk, V.; Aarts, E.H.L.; Lamerikx, F.J.G.

12 p. 1995, .

Research output: Other contributionOther research output

TY - GEN

T1 - Periodic scheduling in a multimedia server

AU - Korst, J.H.M.

AU - Pronk, V.

AU - Aarts, E.H.L.

AU - Lamerikx, F.J.G.

PY - 1995

Y1 - 1995

N2 - We describe how the problem of effectively servicing a number of users by a multimedia server can be represented as a periodic disk scheduling problem. We give an overview of related work and present a number of new results, based on periodically servicing users that have different consumption requirements with different periods. In addition, by scheduling sets of disk accesses as batches the worst-case switching overhead is reduced

AB - We describe how the problem of effectively servicing a number of users by a multimedia server can be represented as a periodic disk scheduling problem. We give an overview of related work and present a number of new results, based on periodically servicing users that have different consumption requirements with different periods. In addition, by scheduling sets of disk accesses as batches the worst-case switching overhead is reduced

U2 - 10.1109/ETFA.1995.496775

DO - 10.1109/ETFA.1995.496775

M3 - Other contribution

SN - 0-7803-2535-4

ER -