This paper revisits utilization bounds for a periodic resource under the rate monotonic (RM) scheduling algorithm. We show that the existing utilization bound, as presented in [8, 9], is optimistic. We subsequently show that by viewing the unavailability of the periodic resource as a deferrable server at highest priority, existing utilization bounds for systems with a deferrable server [3, 11] can be reused. Moreover, using this view, the utilization bound presented in  for hierarchical fixed-priority scheduling turns out to be similar to the bound in .
|Title of host publication||Proceedings Work-in-Progress (WiP) session of the 21st Euromicro Conference on Real-Time Systems (ECRTS'09, Dublin, Ireland, July 1-3, 2009)|
|Publication status||Published - 2009|