Pick any OS that was not dealt with in this lecture Research

Pick any OS that was not dealt with in this lecture. Research it and find out as much as possible about its scheduling policies. Possible topics: an OS for a portable device or OS optimization for servers with massive numbers of simultaneous threads. Pick a topic that you would be interested in researching further for your group project, but do your own work on this assignment.

Solution

Now we are going to discuss about the scheduling policies of Linux operating system. Scheduler makes the CPU busy with processes. Linux scheduler contains many scheduling policies which tells which processes for how much longer should be assigned to the CPU core.

There are multiple types of scheduling policies. Those are

Realtime scheduling policies :-

Realtime threads or process are scheduled first rather than all the other threads. Realtime policies are used for time critical tasks which needs to be executed without break.

SCHED_FIFO:-

This policy works with priorities i.e. It executes the tasks which is having the highest priority first. This is also referred as static priority scheduling.

SCHED_RR:-

This is the policy which is round robin varient of SCHED_FIFO i.e. It also works same like sched_fifo but it is having the time quantum which means for every particular period of time the execution of the thread changes with the new one even the current task is completed or not.

Normal Scheduling Policies :-

These are for the very Normal processes. These are for very low priority jobs ot threads.

SCHED_OTHER:-

This the normal policy this uses the completely fair scheduler. This is the dynamic priority scheduling property based on the niceness value thread.

SCHED_BATCH:-

This is also same as sched_other but the difference is this policy makes the scheduler always assume that the thread is CPU -Intensive

SCHED_IDLE:-

This policy is only for the extreamly low priority jobs.