rate-monotonic scheduling[1] is a scheduling algorithm used in real-time operating systems with a static-priority scheduling class.[2] The static priorities are assigned on the basis of the cycle duration of the job: the shorter the cycle duration is, the higher is the job s priority.



These operating systems are generally preemptive and have deterministic guarantees with regard to response times. Rate monotonic analysis is used in conjunction with those systems to provide scheduling guarantees for a particular application.