The problem of scheduling periodic tasks has been studied extensively since its first introduction by Liu and Layland. They proposed utilization bound, called L&L bound, to guaranty feasibility of task set under rate ...