An efficient schedulability analysis for optimizing systems with adaptive mixed-criticality scheduling
From MaRDI portal
Publication:2364024
Recommendations
- Generalizing fixed-priority scheduling for better schedulability in mixed-criticality systems
- The concept of maximal unschedulable deadline assignment for optimization in fixed-priority scheduled real-time systems
- An exact schedulability test for fixed-priority preemptive mixed-criticality real-time systems
- Fault-tolerant and real-time scheduling for mixed-criticality systems
- Mixed-criticality scheduling with limited hi-criticality behaviors
Cites work
- A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
- An Efficient Formulation of the Real-Time Feasibility Region for Design Optimization
- Dynamic- and static-priority scheduling of recurring real-time tasks
- Efficient Exact Schedulability Tests for Fixed Priority Real-Time Systems
- Implementing mixed-criticality synchronous reactive programs upon uniprocessor platforms
- Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
This page was built for publication: An efficient schedulability analysis for optimizing systems with adaptive mixed-criticality scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364024)