On utilization bounds for a periodic resource under rate monotonic scheduling

A.M. Renssen, van, S.J. Geuns, J.P.H.M. Hausmans, W. Poncin, R.J. Bril

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademic

38 Downloads (Pure)

Abstract

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 [7] for hierarchical fixed-priority scheduling turns out to be similar to the bound in [3].
Original languageEnglish
Title of host publicationProceedings Work-in-Progress (WiP) session of the 21st Euromicro Conference on Real-Time Systems (ECRTS'09, Dublin, Ireland, July 1-3, 2009)
Pages25-28
Publication statusPublished - 2009

Fingerprint Dive into the research topics of 'On utilization bounds for a periodic resource under rate monotonic scheduling'. Together they form a unique fingerprint.

Cite this