Category - cumshot
But the ugly secret to multitasking is that conventional round-robin schedulers are non-deterministic. Its impossible to guarantee that all of the tasks will run in a timely fashion. rate monotonic scheduling is a priority algorithm that belongs to the static priority scheduling category of real time operating systems. The priority is decided according to the cycle time of the processes that are involved. If the process has a small job duration, then it has the highest priority. The rate monotonic scheduling algorithm is a simple rule that assigns priorities to different tasks according to their time period. That is task with smallest time period will have highest priority and a task with longest time period will have lowest priority for execution. The major result of rate-monotonic analysis is that a relatively simple scheduling policy is optimal. Priorities are assigned by rank order of period, with the process with the shortest period being assigned the highest priority. This fixed-priority scheduling policy is the optimum assignment of static priorities to processes, in that it.