Non-Preemptive CPU Scheduling Algorithms

Feb 27, 2026 • 2h 12m • 13 views

CONTENTS: 1. FCFS 2. Non-preemptive priority 3. Shortest Job First Non-preemptive scheduling allows a process to retain the control of the CPU until it either it completes its execution or voluntarily requests I/O (i,.e., voluntarily gets into blocked state). Scheduling decisions are made only when the running process finishes or blocks. This strategy minimizes context switch overhead.