Shortest Job First (SJF)
In this algorithm, the process that has the shortest CPU burst time is selected first for the execution. When the CPU is available it is assign to the process that has theRead More…
Tag Archives: non-preemptive-scheduling-scheme
Scheduling Scheme
When the CPU is forcefully deallocated from the currently running process before its completion, it is called preemption and such scheduling scheme is known as preemptive scheduling. When the CPU is onceRead More…