Skip to content
doubtly

2 answers

Best answer

Answer: In preemptive scheduling the OS can take the CPU away from a running process (time slice over or a higher-priority process arrives); in non-preemptive scheduling a process keeps the CPU until it finishes or blocks for I/O.

Preemptive scheduling: the scheduler may interrupt the running process and move it back to the ready queue. Examples: Round Robin, Shortest Remaining Time First (SRTF), preemptive priority.

Non-preemptive scheduling: once a process gets the CPU it runs until it terminates or waits (I/O, wait()). Examples: FCFS, SJF (non-preemptive), non-preemptive priority.

PointPreemptiveNon-preemptive
CPU releaseCan be forced to leave the CPU (time quantum expiry or higher-priority arrival)Leaves the CPU only on termination or when it blocks
When scheduler runsRunning to ready, waiting to ready, termination, blockingOnly on termination or blocking
PriorityA higher-priority arrival takes the CPU at oncePriority can still be used, but only when choosing the next process; the running one is not interrupted
Response timeGood; suitable for interactive and real-time systemsCan be poor; a long job delays all short ones (convoy effect)
Context switches / overheadMore context switches, more overheadFewer context switches, less overhead
StarvationLow-priority processes may starve (unless ageing is used)Short jobs may wait long behind a long job
Shared dataNeeds synchronisation, since a process can be interrupted mid-updateFewer race conditions inside the kernel
ComplexityMore complex to implementSimple to implement
ExamplesRound Robin, SRTF, preemptive priorityFCFS, SJF, non-preemptive priority
Doubtly · 15 Apr 2023 Report
Was this answer helpful?

Answer: In preemptive scheduling the OS can take the CPU away from a running process; in non-preemptive scheduling a process keeps the CPU until it finishes or blocks (for example, for I/O).

PointPreemptiveNon-preemptive
CPU releaseCPU can be taken away when a higher-priority process arrives or the time slice endsProcess gives up the CPU only when it terminates or waits for I/O
Context switchesMore, so more overheadFewer, so less overhead
Response timeGood; suitable for time-sharing and real-time systemsPoor; a short job may wait behind a long one
StarvationLow-priority processes may starveA long process can hold the CPU for a long time
Shared dataNeeds care, since a process can be interrupted mid-updateSimpler to manage
ExamplesRound Robin, SRTF, preemptive priorityFCFS, SJF (non-preemptive), non-preemptive priority

Priority is used in both types. In non-preemptive priority scheduling, a higher-priority process that arrives simply waits until the running process gives up the CPU.

Note: the earlier answer on this page says non-preemptive scheduling has no priority levels; non-preemptive priority scheduling does exist, as shown above.

Doubtly AI · 24 Oct 2026 AI-verified · Oct 2026 Report
Was this answer helpful?

Your answer

Log in or create a free account to answer this question.