Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review
Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review
}
TY - GEN
T1 - SHRED: a CPU scheduler for heterogeneous applications
AU - Moonian, O
AU - Coulson, G
PY - 2005
Y1 - 2005
N2 - General purpose workstations must support a wide variety of application characteristics; but it is hard to find a single CPU scheduling scheme that satisfactorily schedules processes from all types of applications. It is particularly difficult to get periodic deadline-driven continuous media processes to satisfactorily co-exist with others. A number of schemes have been proposed to address this issue, but these all suffer from one or more of the following limitations: i) unacceptable inefficiency, ii) non-determinism (i.e. introducing significant burstiness or jitter), iii) inability to explicitly support deadlines (so that deadlines may be missed even when the CPU is underloaded). This paper presents "SHRED (SHaretokens, Round-robin, Earliest-deadline-first, Deferred-processing)"-an efficient, proportional-share, deterministic, scheduling scheme that enables periodic deadline-driven processes to meet their explicit deadlines wherever possible, and degrades gracefully and adaptively when this is not possible. The scheme simultaneously ensures that non-deadline processes always obtain their fair share of CPU time whether in conditions of underload or overload. For experimental evaluation, a prototype of SHRED has been developed by replacing the Linux standard scheduler with the SHRED scheduler. The prototype has been evaluated against the standard Linux scheduler for various parameters and also against two proportional-share schemes, namely Stride and VTRR scheduling, for its overhead and its effect on jitter.
AB - General purpose workstations must support a wide variety of application characteristics; but it is hard to find a single CPU scheduling scheme that satisfactorily schedules processes from all types of applications. It is particularly difficult to get periodic deadline-driven continuous media processes to satisfactorily co-exist with others. A number of schemes have been proposed to address this issue, but these all suffer from one or more of the following limitations: i) unacceptable inefficiency, ii) non-determinism (i.e. introducing significant burstiness or jitter), iii) inability to explicitly support deadlines (so that deadlines may be missed even when the CPU is underloaded). This paper presents "SHRED (SHaretokens, Round-robin, Earliest-deadline-first, Deferred-processing)"-an efficient, proportional-share, deterministic, scheduling scheme that enables periodic deadline-driven processes to meet their explicit deadlines wherever possible, and degrades gracefully and adaptively when this is not possible. The scheme simultaneously ensures that non-deadline processes always obtain their fair share of CPU time whether in conditions of underload or overload. For experimental evaluation, a prototype of SHRED has been developed by replacing the Linux standard scheduler with the SHRED scheduler. The prototype has been evaluated against the standard Linux scheduler for various parameters and also against two proportional-share schemes, namely Stride and VTRR scheduling, for its overhead and its effect on jitter.
KW - CPU scheduling
KW - multimedia computing
KW - multimedia OS services
KW - proportional-share
KW - jitter
KW - deadlines
KW - MIDDLEWARE
U2 - 10.1117/12.592143
DO - 10.1117/12.592143
M3 - Conference contribution/Paper
SN - 9780819456564
SP - 132
EP - 143
BT - Embedded Processors for Multimedia and Communications II
A2 - Sudharsanan, Subramania
A2 - Bove, V. Michael
A2 - Panchanathan, Sethuraman
PB - SPIE-INT SOC OPTICAL ENGINEERING
CY - Bellingham, Wash.
T2 - Conference on Embedded Processors for Multimedia and Communications II
Y2 - 17 January 2005 through 18 January 2005
ER -