Maintaining the feasibility of hard real-time systems with a reduced number of priority levels
From MaRDI portal
Publication:326990
Recommendations
Cites work
- Distributed scheduling of sensor networks for identification of spatio-temporal processes
- Efficient Exact Schedulability Tests for Fixed Priority Real-Time Systems
- Fixed priority scheduling with limited priority levels
- scientific article; zbMATH DE number 1031762 (Why is no real title available?)
- scientific article; zbMATH DE number 1106375 (Why is no real title available?)
- scientific article; zbMATH DE number 2112451 (Why is no real title available?)
- On priority assignment in fixed priority scheduling
- On the complexity of fixed-priority scheduling of periodic, real-time tasks
- On-line scheduling of scalable real-time tasks on multiprocessor systems.
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- Sensitivity analysis for fixed-priority real-time systems
This page was built for publication: Maintaining the feasibility of hard real-time systems with a reduced number of priority levels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q326990)