Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
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
The worst-case execution-time problem—overview of methods and survey of tools
ACM Transactions on Embedded Computing Systems (TECS)
Schedulability Analysis of Sporadic Tasks with Multiple Criticality Specifications
ECRTS '08 Proceedings of the 2008 Euromicro Conference on Real-Time Systems
Handling mixed-criticality in SoC-based real-time embedded systems
EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
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
Resource Allocation in Distributed Mixed-Criticality Cyber-Physical Systems
ICDCS '10 Proceedings of the 2010 IEEE 30th International Conference on Distributed Computing Systems
Load-based schedulability analysis of certifiable mixed-criticality systems
EMSOFT '10 Proceedings of the tenth ACM international conference on Embedded software
Mixed-Criticality Real-Time Scheduling for Multicore Systems
CIT '10 Proceedings of the 2010 10th IEEE International Conference on Computer and Information Technology
An Algorithm for Scheduling Certifiable Mixed-Criticality Sporadic Task Systems
RTSS '10 Proceedings of the 2010 31st IEEE Real-Time Systems Symposium
Mixed-criticality scheduling on multiprocessors
Real-Time Systems
| Hi-index | 0.00 |
Real-time embedded systems are becoming more complex to include multiple functionalities. Sharing a computing platform is a natural and effective solution to reducing the cost of those systems. However, the sharing can cause serious problems in mixed-criticality systems where applications have different levels of criticality. Certifying the mixed-criticality systems requires efficient scheduling algorithms and schedulability tests different from the ones used in single criticality systems. In this paper, we propose the first dynamic scheduling algorithm called CBEDF for certifiable mixed-criticality systems on a uniprocessor platform. We show that CBEDF dominates previously proposed algorithms OCBP. In addition, we propose a sufficient schedulability test for CBEDF. We demonstrate that the schedulability test of CBEDF out-performs that of the previously proposed algorithms by performing simulations using randomly generated instances of jobs.