Liu and Layland's schedulability test revisited
From MaRDI portal
Publication:294728
Recommendations
Cites work
Cited in
(14)- Apportionment methods and the Liu-Layland problem
- Errata: A new algorithm for scheduling periodic, real-time tasks
- Commentary to: ``An exact schedulability test for fixed-priority preemptive mixed-criticality real-time systems
- Narrowing the speedup factor gap of partitioned EDF
- Solution of the Liu-Layland problem via bottleneck just-in-time sequencing
- Utilization bound for periodic task set with composite deadline
- Comments on ``Generalized rate monotonic schedulability bounds using relative period ratios
- Rate monotonic schedulability tests using period-dependent conditions
- Exact speedup factors for linear-time schedulability tests for fixed-priority preemptive and non-preemptive scheduling
- Lowest priority first based feasibility analysis of real-time systems
- scientific article; zbMATH DE number 2112450 (Why is no real title available?)
- Measuring the performance of schedulability tests
- Reply to: ``Comments on `Supervisory control for real-time scheduling of periodic and sporadic tasks with resource constraints' .
- Rate monotonic scheduling re-analysed
This page was built for publication: Liu and Layland's schedulability test revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294728)