By the same authors

From the same journal

FIXED PRIORITY SCHEDULING OF HARD REAL-TIME MULTIMEDIA DISK TRAFFIC

Research output: Contribution to journalArticle

Author(s)

Department/unit(s)

Publication details

JournalComputer journal
DatePublished - 1994
Issue number8
Volume37
Number of pages7
Pages (from-to)691-697
Original languageEnglish

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.

Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations