Lancaster EPrints

Scheduling and admission testing for jitter-constrained periodic threads

Mauthe, A and Coulson, G (1997) Scheduling and admission testing for jitter-constrained periodic threads. Multimedia Systems, 5 (5). pp. 337-346. ISSN 1432-1882

Full text not available from this repository.

Abstract

We present new admission tests for periodic realtime threads with explicitly stated deadlines scheduled according to the earliest deadline first (EDF) algorithm. In traditional real-time periodic scheduling, the deadline of a periodic thread is conventionally the end of the current period. In contrast, our tests support periodic threads in which the deadline may be earlier than the end of the current period. In the extreme case, the deadline may be specified as identical to the per period execution time, which results in perfectly isochronous periodic threads. The provision of such threads, which we refer to as jitter-constrained threads, helps end-systems to honour jitter as well as throughput-related QoS parameters in distributed multimedia systems. In addition, such threads can reduce end-to-end delay and buffer memory requirements as less buffering is needed to smooth excessive delay jitter.

Item Type: Article
Journal or Publication Title: Multimedia Systems
Uncontrolled Keywords: REAL-TIME TASKS ; SYSTEMS
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Departments: Faculty of Science and Technology > School of Computing & Communications
ID Code: 52599
Deposited By: ep_importer_pure
Deposited On: 12 Mar 2012 11:28
Refereed?: Yes
Published?: Published
Last Modified: 09 Apr 2014 23:05
Identification Number:
URI: http://eprints.lancs.ac.uk/id/eprint/52599

Actions (login required)

View Item