Liu and Layland's schedulability test revisited
From MaRDI portal
Publication:294728
DOI10.1016/S0020-0190(00)00016-8zbMATH Open1338.68039OpenAlexW2004594807MaRDI QIDQ294728FDOQ294728
Authors: Raymond Devillers, Joël Goossens
Publication date: 16 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019000000168?np=y
Recommendations
Cites Work
Cited In (14)
- Apportionment methods and the Liu-Layland problem
- Measuring the performance of schedulability tests
- Exact speedup factors for linear-time schedulability tests for fixed-priority preemptive and non-preemptive scheduling
- Rate monotonic schedulability tests using period-dependent conditions
- Title not available (Why is that?)
- Rate monotonic scheduling re-analysed
- Solution of the Liu-Layland problem via bottleneck just-in-time sequencing
- Utilization bound for periodic task set with composite deadline
- Lowest priority first based feasibility analysis of real-time systems
- Narrowing the speedup factor gap of partitioned EDF
- Commentary to: ``An exact schedulability test for fixed-priority preemptive mixed-criticality real-time systems
- Comments on ``Generalized rate monotonic schedulability bounds using relative period ratios
- Reply to: ``Comments on `Supervisory control for real-time scheduling of periodic and sporadic tasks with resource constraints' .
- Errata: A new algorithm for scheduling periodic, real-time tasks
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)