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 language | English |
---|---|
Number of pages | 12 |
DOIs | |
Publication status | Published - 1995 |
Externally published | Yes |