Home > Research > Publications & Outputs > Scheduling and admission testing for jitter-con...

Research

Links

Text available via DOI:

Keywords

View graph of relations

Scheduling and admission testing for jitter-constrained periodic threads

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

Scheduling and admission testing for jitter-constrained periodic threads. / Mauthe, A ; Coulson, G .
In: Multimedia Systems, Vol. 5, No. 5, 09.1997, p. 337-346.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Mauthe, A & Coulson, G 1997, 'Scheduling and admission testing for jitter-constrained periodic threads', Multimedia Systems, vol. 5, no. 5, pp. 337-346. https://doi.org/10.1007/s005300050065

APA

Mauthe, A., & Coulson, G. (1997). Scheduling and admission testing for jitter-constrained periodic threads. Multimedia Systems, 5(5), 337-346. https://doi.org/10.1007/s005300050065

Vancouver

Mauthe A, Coulson G. Scheduling and admission testing for jitter-constrained periodic threads. Multimedia Systems. 1997 Sept;5(5):337-346. doi: 10.1007/s005300050065

Author

Mauthe, A ; Coulson, G . / Scheduling and admission testing for jitter-constrained periodic threads. In: Multimedia Systems. 1997 ; Vol. 5, No. 5. pp. 337-346.

Bibtex

@article{077a589696b74a6bbb799be2f671fbfd,
title = "Scheduling and admission testing for jitter-constrained periodic threads",
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.",
keywords = "REAL-TIME TASKS, SYSTEMS",
author = "A Mauthe and G Coulson",
year = "1997",
month = sep,
doi = "10.1007/s005300050065",
language = "English",
volume = "5",
pages = "337--346",
journal = "Multimedia Systems",
issn = "1432-1882",
publisher = "Springer Verlag",
number = "5",

}

RIS

TY - JOUR

T1 - Scheduling and admission testing for jitter-constrained periodic threads

AU - Mauthe, A

AU - Coulson, G

PY - 1997/9

Y1 - 1997/9

N2 - 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.

AB - 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.

KW - REAL-TIME TASKS

KW - SYSTEMS

U2 - 10.1007/s005300050065

DO - 10.1007/s005300050065

M3 - Journal article

VL - 5

SP - 337

EP - 346

JO - Multimedia Systems

JF - Multimedia Systems

SN - 1432-1882

IS - 5

ER -