Abstract
In this paper we show how existing real-time scheduling theory, developed to analyse the behaviour of tasks executing on processing resources, can be applied to the problem of guaranteeing the performance of multi-media information streams read from a disk system. Analysis is derived that takes into account disk layout and predicts the worst-case response times for disk requests. It is shown how buffer size, priority of request and size of non-pre-emptable operations all crucially affect behaviour. The object of the paper is to define an effective run-time test that can be used to determine if new streams can be accommodated.
Original language | English |
---|---|
Pages (from-to) | 691-697 |
Number of pages | 7 |
Journal | Computer journal |
Volume | 37 |
Issue number | 8 |
Publication status | Published - 1994 |