In computer science, rate-monotonic scheduling [1] is a scheduling algorithm used in real-time operating systems with a static-priority scheduling class.
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.
preview:
http://en.wikipedia.org/wiki/Rate-monotonic_scheduling
10/2005/2007
