Non-preemptive/Co-operative Scheduling

Q1. Explain Non-preemptive/Co-operative Scheduling.

Ans. The scheduling algorithm takes the process to run and then run until it blocks (either an input/output or waiting for another process) or until it leaves the CPU. No scheduling decisions are made during clock interrupts.

CPU scheduling decisions may take place,

1. When a process switches from the running state to the waiting state (For example, as the result of an I/O request or an invocation of wait for the termination of one of the child processes).

2. When a process terminates.

Leave a Reply

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

%d bloggers like this: