A preemptive priority scheduling algorithm will preempt the CPU if the priority of the newly arrived process is higher than the priority of the currently running process. A nonpreemptive priority scheduling algorithm however will simply put the new process at the head of the ready queue. Typically on a first come first serve basis. Non-preemptive processes will never starve unless in the situation with an infinite program ahead in queue
A preemptive priority scheduling algorithm will preempt the CPU if the priority of the newly arrived process is higher than the priority of the currently running process. A nonpreemptive priority scheduling algorithm however will simply put the new process at the head of the ready queue. Typically on a first come first serve basis. Non-preemptive processes will never starve unless in the situation with an infinite program ahead in queue
Nice explaination. Keep posting videos Sister.
Clear explanation thanks
Thank you, so Round Robin is preemptive!
Thank you.