Liu and Layland's schedulability test revisited
From MaRDI portal
Publication:294728
DOI10.1016/S0020-0190(00)00016-8zbMath1338.68039OpenAlexW2004594807MaRDI QIDQ294728
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
Related Items
Solution of the Liu-Layland problem via bottleneck just-in-time sequencing, Apportionment methods and the Liu-Layland problem, Rate monotonic scheduling re-analysed, Narrowing the speedup factor gap of partitioned EDF
Cites Work