Shortest remaining time first the name itself says that it is actually we are going to take the shortest jobs but in a different way and it is actually based …
Read moreShortest remaining time first (SFJF) in Operating System
The highest response ratio next of the name itself says that we are going to find something called a response ratio and now we show pulses having the highest of …
Shortage of first where we have picked up the shortage jobs and should use them first here we are going to pick the longest jobs and should enjoy them so …
Process executes it changes its state and the state of a process is defined in part by the current activity of that process so when a process is executing it …
Multi-level queue scheduling and we have seen how it works so there we saw that we have classified our processes into different groups and these groups were made into different …
FCFS scheduling but preemption is added to switch between processes so this round-robin scheduling algorithm in one way is similar to the first come first serve scheduling but preemption is …
Inter process communication where we saw that shared memory systems and message-passing systems were two ways in which inter-process communication can take place so in this lecture we’ll be seeing …
As the name itself says that the shortest is having the least burst time we are going to show you that first that is right in shortest job first and …
One disadvantage of FCFS is there is if there is something called a convoy effect. When a process is having a heavy burst time then all the processes which are …
in the previous lectures we have studied about message-passing systems and shared memory systems which were two strategies that were used for communication between processes so the message passing system …