Liu and Layland's schedulability test revisited

Authors
Devillers, R Goossens, J
Citation
R. Devillers et J. Goossens, Liu and Layland's schedulability test revisited, INF PROCESS, 73(5-6), 2000, pp. 157-161
Citations number
5
Categorie Soggetti
Information Tecnology & Communication Systems
Journal title
INFORMATION PROCESSING LETTERS
ISSN journal
00200190 → ACNP
Volume
73
Issue
5-6
Year of publication
2000
Pages
157 - 161
Database
ISI
SICI code
0020-0190(20000331)73:5-6<157:LALSTR>2.0.ZU;2-U
Abstract
In this paper, we study the problem of scheduling hard real-time periodic t ask sets on a single processor with the rate monotonic scheduler. We are co ncerned with the feasibility test given by Liu and Layland, based on the le ast upper bound of the utilization factor. We show that the result is incom plete and that the argument is incorrect. We complete and correct the resul t. (C) 2000 Elsevier Science B.V. All rights reserved.