Preemptive Shortest Job First

Q6. Explain Preemptive Shortest Job First.

Ans. If a new process arrives with CPU burst length less than remaining time of current executing process, a preemptive SJF algorithm will preempt the currently executing process. This scheme is known as the Shortest Remaining Time First (SRTF).

Leave a Reply

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

%d bloggers like this: