Preemptive/Non-co-operative Scheduling

Q1. Explain Preemptive/Non-co-operative Scheduling.

Ans. This scheduling algorithm, takes a process and run for a maximum of some fixed time. If it is still running at the end of time interval, it is suspended and the other process will run by scheduler.

CPU scheduling decisions may take place when process,

  1. When a process switches from running to ready state (For example, when the interrupt occurs).
  2. When a process switches from waiting to ready state (For example, at completion of input/output).

Leave a Reply

Your email address will not be published. Required fields are marked *

%d bloggers like this: