Schedulability analysis of a graph-based task model for mixed-criticality systems

Pontus Ekberg; Wang Yi

doi:10.1007/s11241-015-9225-0

Schedulability analysis of a graph-based task model for mixed-criticality systems

Pontus Ekberg^*
, Wang Yi

^*Corresponding author for this work

Uppsala University

Research output: Contribution to journal › Article › peer-review

17 Scopus citations

Abstract

We present a new graph-based real-time task model that can specify complex job arrival patterns and global state-based mode switching. The mode switching is of a mixed-criticality style, meaning that it allows immediate changes to the parameters of active jobs upon mode switches. The resulting task model generalizes previously proposed task graph models as well as mixed-criticality (sporadic) task models; the merging of these mutually incomparable modeling paradigms allows formulation of new types of tasks. A sufficient schedulability analysis for EDF on preemptive uniprocessors is developed for the proposed model.

Original language	English
Pages (from-to)	1-37
Number of pages	37
Journal	Real-Time Systems
Volume	52
Issue number	1
DOIs	https://doi.org/10.1007/s11241-015-9225-0
State	Published - 1 Jan 2016
Externally published	Yes

Keywords

Mixed-criticality
Real-time
Schedulability analysis
Task graphs

Access to Document

10.1007/s11241-015-9225-0

Cite this

@article{aa489bf63af44f588c42981b61606868,

title = "Schedulability analysis of a graph-based task model for mixed-criticality systems",

abstract = "We present a new graph-based real-time task model that can specify complex job arrival patterns and global state-based mode switching. The mode switching is of a mixed-criticality style, meaning that it allows immediate changes to the parameters of active jobs upon mode switches. The resulting task model generalizes previously proposed task graph models as well as mixed-criticality (sporadic) task models; the merging of these mutually incomparable modeling paradigms allows formulation of new types of tasks. A sufficient schedulability analysis for EDF on preemptive uniprocessors is developed for the proposed model.",

keywords = "Mixed-criticality, Real-time, Schedulability analysis, Task graphs",

author = "Pontus Ekberg and Wang Yi",

note = "Publisher Copyright: {\textcopyright} 2015, Springer Science+Business Media New York.",

year = "2016",

month = jan,

day = "1",

doi = "10.1007/s11241-015-9225-0",

language = "英语",

volume = "52",

pages = "1--37",

journal = "Real-Time Systems",

issn = "0922-6443",

publisher = "Springer Netherlands",

number = "1",

}

TY - JOUR

T1 - Schedulability analysis of a graph-based task model for mixed-criticality systems

AU - Ekberg, Pontus

AU - Yi, Wang

PY - 2016/1/1

Y1 - 2016/1/1

N2 - We present a new graph-based real-time task model that can specify complex job arrival patterns and global state-based mode switching. The mode switching is of a mixed-criticality style, meaning that it allows immediate changes to the parameters of active jobs upon mode switches. The resulting task model generalizes previously proposed task graph models as well as mixed-criticality (sporadic) task models; the merging of these mutually incomparable modeling paradigms allows formulation of new types of tasks. A sufficient schedulability analysis for EDF on preemptive uniprocessors is developed for the proposed model.

AB - We present a new graph-based real-time task model that can specify complex job arrival patterns and global state-based mode switching. The mode switching is of a mixed-criticality style, meaning that it allows immediate changes to the parameters of active jobs upon mode switches. The resulting task model generalizes previously proposed task graph models as well as mixed-criticality (sporadic) task models; the merging of these mutually incomparable modeling paradigms allows formulation of new types of tasks. A sufficient schedulability analysis for EDF on preemptive uniprocessors is developed for the proposed model.

KW - Mixed-criticality

KW - Real-time

KW - Schedulability analysis

KW - Task graphs

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

U2 - 10.1007/s11241-015-9225-0

DO - 10.1007/s11241-015-9225-0

M3 - 文章

AN - SCOPUS:84953361246

SN - 0922-6443

VL - 52

SP - 1

EP - 37

JO - Real-Time Systems

JF - Real-Time Systems

IS - 1

ER -

Schedulability analysis of a graph-based task model for mixed-criticality systems

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this