Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
On priority asignment in fixed priority scheduling
Information Processing Letters
Integrating Multimedia Applications in Hard Real-Time Systems
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
FUNDAMENTAL DESIGN PROBLEMS OF DISTRIBUTED SYSTEMS FOR THE HARD-REAL-TIME ENVIRONMENT
FUNDAMENTAL DESIGN PROBLEMS OF DISTRIBUTED SYSTEMS FOR THE HARD-REAL-TIME ENVIRONMENT
Rate monotonic vs. EDF: judgment day
Real-Time Systems
Preemptive Scheduling of Multi-criticality Systems with Varying Degrees of Execution Time Assurance
RTSS '07 Proceedings of the 28th IEEE International Real-Time Systems Symposium
Schedulability Analysis of Sporadic Tasks with Multiple Criticality Specifications
ECRTS '08 Proceedings of the 2008 Euromicro Conference on Real-Time Systems
On the Scheduling of Mixed-Criticality Real-Time Task Sets
RTSS '09 Proceedings of the 2009 30th IEEE Real-Time Systems Symposium
Effective and Efficient Scheduling of Certifiable Mixed-Criticality Sporadic Task Systems
RTSS '11 Proceedings of the 2011 IEEE 32nd Real-Time Systems Symposium
Response-Time Analysis for Mixed Criticality Systems
RTSS '11 Proceedings of the 2011 IEEE 32nd Real-Time Systems Symposium
Implementation and Evaluation of Mixed-Criticality Scheduling Approaches for Periodic Tasks
RTAS '12 Proceedings of the 2012 IEEE 18th Real Time and Embedded Technology and Applications Symposium
The Preemptive Uniprocessor Scheduling of Mixed-Criticality Implicit-Deadline Sporadic Task Systems
ECRTS '12 Proceedings of the 2012 24th Euromicro Conference on Real-Time Systems
| Hi-index | 0.00 |
In modern embedded platforms, safety-critical functionalities that must be certified correct to very high levels of assurance may co-exist with less critical software that is not subject to certification requirements. One seeks to satisfy two, sometimes contradictory, goals upon such mixed-criticality platforms: (i) certify the safety-critical functionalities under very conservative assumptions, and (ii) achieve high resource utilization during run-time, when actual behavior does not live up to the pessimistic assumptions under which certification was made. This paper makes two contributions: (i) it surveys different fixed-priority scheduling algorithms that have been proposed, that seek to balance these two requirements, and (ii) it completes prior work that performs a comparative evaluation of these different fixed-priority scheduling algorithms. It particularly focuses upon the period transformation technique for dual-criticality scheduling, since this technique has received relatively less attention in prior work.