Scheduling Real-Time Mixed-Criticality Jobs
From MaRDI portal
Publication:5274656
Cited in
(16)- Speed-robust scheduling: sand, bricks, and rocks
- Speed-robust scheduling. Sand, bricks, and rocks
- Scheduling with uncertain processing times in mixed-criticality systems
- An analysis of the non-preemptive mixed-criticality match-up scheduling problem
- Dynamic budget management and budget reclamation for mixed-criticality systems
- FFOB: efficient online mode-switch procrastination in mixed-criticality systems
- Priority-based scheduling of mixed-critical jobs
- Intractability issues in mixed-criticality scheduling
- Implementing mixed-criticality synchronous reactive programs upon uniprocessor platforms
- The triangle scheduling problem
- Preemptive uniprocessor scheduling of mixed-criticality sporadic task systems
- Bounding and shaping the demand of generalized mixed-criticality sporadic task systems
- Schedulability analysis of a graph-based task model for mixed-criticality systems
- A fault-tolerant time-triggered scheduling algorithm of mixed-criticality systems
- Graph-based models for real-time workload: a survey
- Fault-tolerant and real-time scheduling for mixed-criticality systems
This page was built for publication: Scheduling Real-Time Mixed-Criticality Jobs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5274656)