A generalized utilization bound test for fixed-priority real-time scheduling

Abstract

Liu & Layland provided a utilization bound test which is applicable to rate-monotonic priority assignment, when all tasks deadlines axe at the end of their periods. Subsequently, Lehoczky and others provided an exact schedulability criterion which is applicable to any arbitrary priority assignment scheme, with no restriction on task deadlines, which can be used when all task computation times are known exactly. In this work we fill an important gap between these two, by presenting a technique for deriving utilization bounds, based on linear programming, that is applicable to any fixed priority scheduling, but does not require knowledge of exact task computation times.