Editing Rate-monotonic scheduling (section)

{{Short description|Scheduling technique in computer science}}
In [[computer science]], '''rate-monotonic scheduling''' ('''RMS''')<ref>{{citation|first1=C. L.|last1=Liu|author-link1=Chung Laung Liu|first2=J.|last2=Layland|title=Scheduling algorithms for multiprogramming in a hard real-time environment|journal=Journal of the ACM|volume=20|issue=1|year=1973|pages=46–61|doi=10.1145/321738.321743|citeseerx=10.1.1.36.8216|s2cid=207669821}}.</ref> is a priority assignment algorithm used in [[real-time operating system]]s (RTOS) with a static-priority scheduling class.<ref>{{citation|first1=Daniel P.|last1=Bovet|first2=Marco|last2=Cesati|title=Understanding the Linux Kernel}}, http://oreilly.com/catalog/linuxkernel/chapter/ch10.html#85347 {{webarchive|url=https://web.archive.org/web/20140921000832/http://oreilly.com/catalog/linuxkernel/chapter/ch10.html |date=2014-09-21 }}.</ref> The static priorities are assigned according to the cycle duration of the job, so a shorter cycle duration results in a higher job priority.

These operating systems are generally [[preemption (computing)|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.