Real-time scheduling algorithm for safety-critical systems on faulty multicore environments
From MaRDI portal
Publication:2362230
Recommendations
- Fault-tolerant and real-time scheduling for mixed-criticality systems
- A fault-tolerant real-time scheduling algorithm supporting tasks of multilevel criticality
- Scheduling algorithms with fault detection and location capabilities for real-time multiprocessor systems
- scientific article; zbMATH DE number 2144112
- On Scheduling Tasks with a Quick Recovery from Failure
Cites work
- A survey of hard real-time scheduling for multiprocessor systems
- Computing k-out-of-n System Reliability
- Fault-tolerant and real-time scheduling for mixed-criticality systems
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 716745 (Why is no real title available?)
- scientific article; zbMATH DE number 5182532 (Why is no real title available?)
- On computing the distribution function for the Poisson binomial distribution
- Proportionate progress: A notion of fairness in resource allocation
Cited in
(6)- Optimal work-conserving scheduler synthesis for real-time sporadic tasks using supervisory control of timed discrete-event systems
- Fault-tolerant and real-time scheduling for mixed-criticality systems
- A fault-tolerant real-time scheduling algorithm based on a prediction-table
- A fault-tolerant real-time scheduling algorithm supporting tasks of multilevel criticality
- Simultaneous multithreading and hard real time: can it be safe?
- Analysis and elimination of noise-induced temperature error in processor thermal control
This page was built for publication: Real-time scheduling algorithm for safety-critical systems on faulty multicore environments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2362230)