Bounding and shaping the demand of mixed-criticality sporadic tasks

Pontus Ekberg; Wang Yi

doi:10.1109/ECRTS.2012.24

Bounding and shaping the demand of mixed-criticality sporadic tasks

Pontus Ekberg^*
, Wang Yi

^*Corresponding author for this work

Uppsala University

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

117 Scopus citations

Abstract

We derive demand-bound functions for mixed-criticality sporadic tasks, and use these to determine EDF-schedulability. Tasks have different demand-bound functions for each criticality mode. We show how to shift execution demand from high-to low-criticality mode by tuning the relative deadlines. This allows us to shape the demand characteristics of each task. We propose an efficient algorithm for tuning all relative deadlines of a task set in order to shape the total demand to the available supply of the computing platform. Experiments indicate that this approach is significantly more powerful than previous approaches to mixed-criticality scheduling. This new approach has the added benefit of supporting hierarchical scheduling frameworks.

Original language	English
Title of host publication	Proceedings of the 24th Euromicro Conference on Real-Time Systems, ECRTS 2012
Pages	135-144
Number of pages	10
DOIs	https://doi.org/10.1109/ECRTS.2012.24
State	Published - 2012
Externally published	Yes
Event	24th Euromicro Conference on Real-Time Systems, ECRTS 2012 - Pisa, Italy Duration: 10 Jul 2012 → 13 Jul 2012

Publication series

Name	Proceedings - Euromicro Conference on Real-Time Systems
ISSN (Print)	1068-3070

Conference

Conference	24th Euromicro Conference on Real-Time Systems, ECRTS 2012
Country/Territory	Italy
City	Pisa
Period	10/07/12 → 13/07/12

Keywords

Real time systems
mixed-criticality
scheduling

Access to Document

10.1109/ECRTS.2012.24

Cite this

@inproceedings{e6a15865559945ef859f308cebe3b7e4,

title = "Bounding and shaping the demand of mixed-criticality sporadic tasks",

abstract = "We derive demand-bound functions for mixed-criticality sporadic tasks, and use these to determine EDF-schedulability. Tasks have different demand-bound functions for each criticality mode. We show how to shift execution demand from high-to low-criticality mode by tuning the relative deadlines. This allows us to shape the demand characteristics of each task. We propose an efficient algorithm for tuning all relative deadlines of a task set in order to shape the total demand to the available supply of the computing platform. Experiments indicate that this approach is significantly more powerful than previous approaches to mixed-criticality scheduling. This new approach has the added benefit of supporting hierarchical scheduling frameworks.",

keywords = "Real time systems, mixed-criticality, scheduling",

author = "Pontus Ekberg and Wang Yi",

year = "2012",

doi = "10.1109/ECRTS.2012.24",

language = "英语",

isbn = "9780769547398",

series = "Proceedings - Euromicro Conference on Real-Time Systems",

pages = "135--144",

booktitle = "Proceedings of the 24th Euromicro Conference on Real-Time Systems, ECRTS 2012",

note = "24th Euromicro Conference on Real-Time Systems, ECRTS 2012 ; Conference date: 10-07-2012 Through 13-07-2012",

}

Ekberg, P & Yi, W 2012, Bounding and shaping the demand of mixed-criticality sporadic tasks. in Proceedings of the 24th Euromicro Conference on Real-Time Systems, ECRTS 2012., 6257566, Proceedings - Euromicro Conference on Real-Time Systems, pp. 135-144, 24th Euromicro Conference on Real-Time Systems, ECRTS 2012, Pisa, Italy, 10/07/12. https://doi.org/10.1109/ECRTS.2012.24

TY - GEN

T1 - Bounding and shaping the demand of mixed-criticality sporadic tasks

AU - Ekberg, Pontus

AU - Yi, Wang

PY - 2012

Y1 - 2012

N2 - We derive demand-bound functions for mixed-criticality sporadic tasks, and use these to determine EDF-schedulability. Tasks have different demand-bound functions for each criticality mode. We show how to shift execution demand from high-to low-criticality mode by tuning the relative deadlines. This allows us to shape the demand characteristics of each task. We propose an efficient algorithm for tuning all relative deadlines of a task set in order to shape the total demand to the available supply of the computing platform. Experiments indicate that this approach is significantly more powerful than previous approaches to mixed-criticality scheduling. This new approach has the added benefit of supporting hierarchical scheduling frameworks.

AB - We derive demand-bound functions for mixed-criticality sporadic tasks, and use these to determine EDF-schedulability. Tasks have different demand-bound functions for each criticality mode. We show how to shift execution demand from high-to low-criticality mode by tuning the relative deadlines. This allows us to shape the demand characteristics of each task. We propose an efficient algorithm for tuning all relative deadlines of a task set in order to shape the total demand to the available supply of the computing platform. Experiments indicate that this approach is significantly more powerful than previous approaches to mixed-criticality scheduling. This new approach has the added benefit of supporting hierarchical scheduling frameworks.

KW - Real time systems

KW - mixed-criticality

KW - scheduling

UR - https://www.scopus.com/pages/publications/84866451513

U2 - 10.1109/ECRTS.2012.24

DO - 10.1109/ECRTS.2012.24

M3 - 会议稿件

AN - SCOPUS:84866451513

SN - 9780769547398

T3 - Proceedings - Euromicro Conference on Real-Time Systems

SP - 135

EP - 144

BT - Proceedings of the 24th Euromicro Conference on Real-Time Systems, ECRTS 2012

T2 - 24th Euromicro Conference on Real-Time Systems, ECRTS 2012

Y2 - 10 July 2012 through 13 July 2012

ER -

Bounding and shaping the demand of mixed-criticality sporadic tasks

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this