Rate monotonic scheduling

(redirected from Rate-monotonic scheduling)
Also found in: Wikipedia.

Rate monotonic scheduling

(algorithm)
A means of scheduling the time allocated to periodic hard-deadline real-time users of a resource. The users are assigned priorities such that a shorter fixed period between deadlines is associated with a higher priority.

Rate monotonic scheduling provides a low-overhead, reasonably resource-efficient means of guaranteeing that all users will meet their deadlines provided that certain analytical equations are satisfied during the system design. It avoids the design complexity of time-line scheduling and the overhead of dynamic approaches such as earliest-deadline scheduling.

[D. R. Wilcox, Naval Ocean Systems Center Technical Report 1310, August 1989, "Periodic Phase Adjustment Distributed Clock Synchronization in the Hard Realtime Environment", p. 9].
References in periodicals archive ?
Figure 2 shows the execution sequences generated by rate-monotonic scheduling for the above example when each task executes at its worst-case computation time.
Now, we say that pinwheel scheduling result generated by static priority of rate-monotonic scheduling policy is the same as that generated by dynamic priority of EDF.
There is no difference between the scheduling results of rate-monotonic scheduling and EDF in case of pinwheel task model.
The priority of rate-monotonic scheduling is determined by the length of task's period and is static.
For the cases of choosing the highest priority ready task when multiple tasks start at the same time and when the previous task ends or an existing ready task resumes, the selected highest priority task of rate-monotonic scheduling has the shortest deadline and the smallest index because all periods are harmonic.
Kuo, "Procrastination for leakage-aware rate-monotonic scheduling on a dynamic voltage scaling processor," in Proceedings of the ACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES '06), pp.
Rate-Monotonic Scheduling. Rate-monotonic analysis (2) allows developers of real-time systems to determine whether a collection of real-time tasks will execute within deadlines.
Rate-monotonic scheduling, originally developed by Liu and Layland, was the first well-known result of this kind.
We use rate-monotonic scheduling for the servo-control levels, and in fact, for all levels.