Abstract
This paper introduces probabilistic analysis for fixed priority preemptive scheduling of mixed criticality systems on a uniprocessor using the Adaptive Mixed Criticality (AMC) and Static Mixed Criticality (SMC) schemes. We compare this analysis to existing deterministic methods, highlighting the performance gains that can be obtained by utilising more detailed information about worst-case execution time estimates described in terms of probability distributions. Besides improvements in schedulability we also demonstrate significant gains in terms of the budgets that can be allocated to LO-criticality tasks.
Original language | English |
---|---|
Title of host publication | Proceedings of the 25th International Conference on Real-Time Networks and Systems, RTNS 2017 |
Publisher | Association for Computing Machinery |
Pages | 237-246 |
Number of pages | 10 |
ISBN (Electronic) | 9781450352864 |
DOIs | |
Publication status | Published - Oct 4 2017 |
Externally published | Yes |
Event | 25th International Conference on Real-Time Networks and Systems, RTNS 2017 - Grenoble, France Duration: Oct 4 2017 → Oct 6 2017 |
Publication series
Name | ACM International Conference Proceeding Series |
---|---|
Volume | Part F131837 |
Conference
Conference | 25th International Conference on Real-Time Networks and Systems, RTNS 2017 |
---|---|
Country/Territory | France |
City | Grenoble |
Period | 10/4/17 → 10/6/17 |
Bibliographical note
Publisher Copyright:© 2017 ACM.
ASJC Scopus Subject Areas
- Software
- Human-Computer Interaction
- Computer Vision and Pattern Recognition
- Computer Networks and Communications
Keywords
- Fixed priority
- Mixed criticality
- Probabilities
- Real-Time systems
- Schedulability analysis