Proceedings of the 23rd International Conference on Real Time and Networks Systems 2015
DOI: 10.1145/2834848.2834873
|View full text |Cite
|
Sign up to set email alerts
|

Generalized mixed-criticality scheduling based on RUN

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 12 publications
0
2
0
Order By: Relevance
“…A global allocation scheme for MCS is proposed by Gratia et al [2014Gratia et al [ , 2015. They adapt the RUN scheduler [Regnier et al 2011], which uses a hierarchy of servers, to accommodate high-and low-criticality tasks.…”
Section: Task Allocationmentioning
confidence: 99%
See 1 more Smart Citation
“…A global allocation scheme for MCS is proposed by Gratia et al [2014Gratia et al [ , 2015. They adapt the RUN scheduler [Regnier et al 2011], which uses a hierarchy of servers, to accommodate high-and low-criticality tasks.…”
Section: Task Allocationmentioning
confidence: 99%
“…They adapt the RUN scheduler [Regnier et al 2011], which uses a hierarchy of servers, to accommodate high-and low-criticality tasks. The latest version of their scheduler (GMC-RUN) [Gratia et al 2015] has been extended to deal with more than two criticality levels.…”
Section: Task Allocationmentioning
confidence: 99%