Elastic Task Model for Adaptive Rate Control
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Dynamic Integrated Scheduling of Hard Real-Time, Soft Real-Time and Non-Real-Time Processes
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
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
Task Scheduling for Control Oriented Requirements for Cyber-Physical Systems
RTSS '08 Proceedings of the 2008 Real-Time Systems Symposium
Reliability-Aware Energy Management for Periodic Real-Time Tasks
IEEE Transactions on Computers
On the Scheduling of Mixed-Criticality Real-Time Task Sets
RTSS '09 Proceedings of the 2009 30th IEEE Real-Time Systems Symposium
Towards the Design of Certifiable Mixed-criticality Systems
RTAS '10 Proceedings of the 2010 16th IEEE Real-Time and Embedded Technology and Applications Symposium
Capacity sharing for overrun control
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems 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
Relaxing Mixed-Criticality Scheduling Strictness for Task Sets Scheduled with FP
ECRTS '12 Proceedings of the 2012 24th Euromicro Conference on Real-Time Systems
Two protocols to reduce the criticality level of multiprocessor mixed-criticality systems
Proceedings of the 21st International conference on Real-Time Networks and Systems
| Hi-index | 0.00 |
To address the service abrupt problem for low-criticality tasks in existing mixed-criticality scheduling algorithms, we study an Elastic Mixed-Criticality (E-MC) task model, where the key idea is to have variable periods (i.e., service intervals) for low-criticality tasks. The minimum service requirement of a low-criticality task is ensured by its largest period. However, at runtime low-criticality tasks can be released early by exploiting the slack time generated from the over-provisioned execution time for high-criticality tasks to reduce their service intervals and thus improve their service levels. We propose an Early-Release EDF (ER-EDF) scheduling algorithm, which can judiciously manage the early release of low-criticality tasks without affecting the timeliness of high-criticality tasks. Compared to the state-of-the-art EDF-VD scheduling algorithm, our simulation results show that the ER-EDF can successfully schedule much more task sets. Moreover, the achieved execution frequencies of low-criticality tasks can also be significantly improved under ER-EDF.