Scheduling techniques in Windows 8 process management

Generally, we perform our operation on Windows operating system using preemptive or non-preemptive algorithms. Using preemptive scheduling a running process can be replaced by a higher priority process at any time whereas non-preemptive scheduling cannot allow any process to leave the ownership of CPU while any other process is ready for its execution. In some diplomatic circumstances, the operating system itself manage the scheduling of currently running processes based on the best effective input choice.Therefore, below is the list of the various scheduling techniques used in the computer system and all of them are described below-

First come First Serve scheduling

It is the Scheduling technique in which multiple processes are executed in the same order in which they exist in the ready queue and the long term scheduler are responsible for their execution in a queue form. For example-Consider three processes, the burst time of first is 1 milliseconds, the burst time of second process is 8 milliseconds, and third process whose burst time is 5 milliseconds. Among all these processes, only the process which comes first will be executed without worrying about the lesser burst time process. The only problem that exists with this scheduling technique is convey effect in which smaller programs will have to wait for their execution while any larger program comes first.

Shortest time First scheduling

In this scheduling, we make a group of several running processes with their shortest running time such that all currently running processes are arranged in the increasing order of their execution time and thus smaller processes are executed first. For example- consider three processes, the burst time of first is 8 milliseconds, the burst time of second is 5 milliseconds and burst time of third process is 10 milliseconds. Among all these processes, second process with 5 milliseconds will be executed first then the process with 8 milliseconds will be executed and finally process with 10 milliseconds will be executed. The only problem with this scheduling is starvation effect in which larger program will have to wait for the smaller programs and executed only after all those smaller processes will be executed.

Round Robin scheduling

The problem of starvation effect and convey effect are removed by it up to some extent by providing equal time slot to each process. Let us consider five processes as P1, P2, P3, P4 and P5 then the best solution is to provide equal time quantum to each process so that every process will get same time slot for its execution. In this way, operating system execute processes with round robing scheduling in sharable manner.

It is operating system which makes final decision of selection of different scheduling techniques by considering the full utilization of system CPU as its primary goal.

Scheduling techniques in Windows 8 process management

First come First Serve scheduling

Shortest time First scheduling

Round Robin scheduling

Post Comment: