Lowest priority first based feasibility analysis of real-time systems
From MaRDI portal
Publication:897377
Recommendations
Cites work
- scientific article; zbMATH DE number 1179312 (Why is no real title available?)
- Efficient Exact Schedulability Tests for Fixed Priority Real-Time Systems
- Efficient Exact Test for Rate-Monotonic Schedulability Using Large Period-Dependent Initial Values
- Machine scheduling with job class setup and delivery considerations
- New strategies for assigning real-time tasks to multiprocessor systems
- On priority assignment in fixed priority scheduling
- On the complexity of fixed-priority scheduling of periodic, real-time tasks
- Power efficient rate monotonic scheduling for multi-core systems
- Preemptive scheduling in overloaded systems.
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- Utilization bound for periodic task set with composite deadline
Cited in
(2)
This page was built for publication: Lowest priority first based feasibility analysis of real-time systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897377)