Liu and Layland's schedulability test revisited

Abstract

In this paper, we study the problem of scheduling hard real-time periodic task sets on a single processor with the rate monotonic scheduler. We are concerned with the feasibility test given by Liu and Layland, based on the least upper bound of the utilization factor. We show that the result is incomplete and that the argument is incorrect. We complete and correct the result.