CPU scheduling policies

A scheduling policy characterizes how CPU processes are selected and promoted from the ready state to the running state. Every operating system operates by governing a well defined scheduling policy.  Choice of scheduling policy is very important to tune timing requirements and fixing the required horsepower of CPU for the superior system functioning. Schedulability is a query of existence of a schedule of execution for the processes in a system that satisfies all their timing requirements. For this either construct a schedule to show schedulability or eliminate some processes terming unschedulable using some techniques. CPU utilization, one of the key metrics in the evaluation of scheduling policy should not cross 100%. Hyperperiod which is the LCM of the periods of all the CPU processes is considered during CPU utilization evaluation. Cyclostatic which is also known as time division multiple access scheduling is a simple scheduling policy. Here whole schedule is divided into equal-sized time slots over an interval equal to the length of the hyperperiod. Round robin is another scheduling policy which uses the same hyperperiod as cyclostatic but here when process does not have any useful work to do, round-robin scheduler moves on to the next process in order to fill the time slot with useful work.