Hybrid algorithms for dynamic schedulability testing

Charlie McElhone; A. Burns; R. Davis

doi:10.1109/EMWRTS.1995.514319

Hybrid algorithms for dynamic schedulability testing

Charlie McElhone, A. Burns, R. Davis

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

The paper describes an investigation into the performance of a variety of algorithms for dynamic schedulability testing. A real time node may run its own set of resident periodic tasks and may also receive aperiodic requests for computations to be completed within hard deadlines. In order to decide whether each request is schedulable, and can therefore be accepted, the node may use a guarantee algorithm. Such algorithms trade off complexity against pessimism. The paper describes how algorithms of hybrid complexity can achieve the best trade off for given characteristics of the resident periodic task set

Original language	English
Title of host publication	Euromicro Workshop on Real-Time Systems
Pages	254-261
Number of pages	8
DOIs	https://doi.org/10.1109/EMWRTS.1995.514319
Publication status	Published - Jun 1995

Access to Document

10.1109/EMWRTS.1995.514319

http://www-users.cs.york.ac.uk/~robdavis/

Cite this

@inproceedings{4da8677110b34d318f1ab1115b84cfa4,

title = "Hybrid algorithms for dynamic schedulability testing",

abstract = "The paper describes an investigation into the performance of a variety of algorithms for dynamic schedulability testing. A real time node may run its own set of resident periodic tasks and may also receive aperiodic requests for computations to be completed within hard deadlines. In order to decide whether each request is schedulable, and can therefore be accepted, the node may use a guarantee algorithm. Such algorithms trade off complexity against pessimism. The paper describes how algorithms of hybrid complexity can achieve the best trade off for given characteristics of the resident periodic task set",

author = "Charlie McElhone and A. Burns and R. Davis",

year = "1995",

month = jun,

doi = "10.1109/EMWRTS.1995.514319",

language = "English",

pages = "254--261",

booktitle = "Euromicro Workshop on Real-Time Systems",

}

TY - GEN

T1 - Hybrid algorithms for dynamic schedulability testing

AU - McElhone, Charlie

AU - Burns, A.

AU - Davis, R.

PY - 1995/6

Y1 - 1995/6

N2 - The paper describes an investigation into the performance of a variety of algorithms for dynamic schedulability testing. A real time node may run its own set of resident periodic tasks and may also receive aperiodic requests for computations to be completed within hard deadlines. In order to decide whether each request is schedulable, and can therefore be accepted, the node may use a guarantee algorithm. Such algorithms trade off complexity against pessimism. The paper describes how algorithms of hybrid complexity can achieve the best trade off for given characteristics of the resident periodic task set

AB - The paper describes an investigation into the performance of a variety of algorithms for dynamic schedulability testing. A real time node may run its own set of resident periodic tasks and may also receive aperiodic requests for computations to be completed within hard deadlines. In order to decide whether each request is schedulable, and can therefore be accepted, the node may use a guarantee algorithm. Such algorithms trade off complexity against pessimism. The paper describes how algorithms of hybrid complexity can achieve the best trade off for given characteristics of the resident periodic task set

U2 - 10.1109/EMWRTS.1995.514319

DO - 10.1109/EMWRTS.1995.514319

M3 - Conference contribution

SP - 254

EP - 261

BT - Euromicro Workshop on Real-Time Systems

ER -