We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
The yielding-first rate-monotonic scheduling approach and its efficiency assessment.
- Authors
Naghibzadeh, Mahmoud; Kim, K. H.
- Abstract
The rate-monotonic (RM) fixed-priority scheduling approach is one of the oldest scheduling approaches devised for use in RT computing systems. Three decades ago researchers found that if the workload presented by the set of processes is below a certain bound, the system using the RM approach can execute safely, i.e., without introducing the possibility of a deadline violation. In this paper, we identify some cases where a bound for the workload which is higher than the previously known bound can be used without compromising the execution safety. We then present an extension of the RM approach named the yielding-first rate-monotonic (YFRM) approach under which each ready process goes through a fixed period of yielding to lower-priority ready processes before exercising its priority fully. For two special cases we show that full processor utilization is possible with the YFRM approach. The YFRM and RM approaches are then compared and it is shown that there are many systems that execute safely under the YFRM approach but are prone to deadline misses under the RM approach. Also, for a set of randomly generated systems, the number of process preemptions under each approach is examined.
- Subjects
PRODUCTION scheduling; REAL-time computing; COMPUTER systems; COMPUTER architecture; COMPUTER networks
- Publication
Computer Systems Science & Engineering, 2003, Vol 18, Issue 3, p173
- ISSN
0267-6192
- Publication type
Article