Editing Rate-monotonic scheduling (section)

=== Hyperbolic bound ===
The hyperbolic bound<ref>{{citation|author1=Enrico Bini |author2=Giorgio C. Buttazzo |author3=Giuseppe M. Buttazzo |title=Rate Monotonic Analysis: the Hyperbolic Bound|journal=IEEE Transactions on Computers|year=2003|volume=52|issue=7|pages=933–942|doi=10.1109/TC.2003.1214341|hdl=11382/200358|hdl-access=free}}</ref> is a tighter sufficient condition for schedulability than the one presented by Liu and Layland:
:<math>\prod_{i=1}^n (U_i +1) \leq 2</math>,
where {{mvar|U<sub>i</sub>}} is the CPU utilization for each task.  It is the tightest upper bound that can be found using only the individual task utilization factors.