Non Preemptive Scheduling in Operating System (OS)

Non preemptive scheduling algorithm

On this page, we will learn the concepts of non preemptive scheduling in operating system (OS) with detailed explanation.Non preemptive scheduling is a type of scheduling process where the resources allocated to a process are released only after the process gets fully executed.

Non preemptive scheduling in operating system (OS)


An operating system often assigns the CPU to processes that need execution. The method used to carry out such a function is known as Scheduling. The method can be of two types, pre-emptive, and non-preemptive scheduling. In the first case, every process is allocated a fixed amount of time to the CPU. When this time is over, the process is replaced by another process which is waiting for the state. On the other hand, the second type of scheduling is the non-preemptive scheduling in which, the process releases the CPU only after its execution is completed.


Non Pre-emptive Scheduling

In this case, once the process is allocated the CPU, it is only released when the processing is over. The states into which a process switches are the running state to the waiting state. It is an approach in which a process is not interrupted when it is under process by the CPU.


Non-Preemptive Type Scheduling

Some of the important points about this approach are:
  • Once the CPU starts executing a process, it finishes before picking up another process.
  • Less CPU utilization as compared to pre-emptive scheduling.
  • In this case, the response time and the waiting time is more.
  • Once a process enters the running state, its state is not deleted from the scheduler until the process is finished executing or finishes its service time.
  • If a process with a long burst time is being executed, then a process with minimum burst time might have to starve.
  • The scheduling approach is also known as rigid.
  • Some of its examples are FCFS, SJF, Priority, etc.
Learn more about non preemptive scheduling through Shortest Job First Scheduling (SJF) algorithm here. The following diagrammatic representation explains the concept.
Process Arrival TimeCPU Burst Time (in milliseconds)
Non Preemptive Scheduling

Prime Course Trailer

Related Banners

Get PrepInsta Prime & get Access to all 200+ courses offered by PrepInsta in One Subscription

Get over 200+ course One Subscription

Courses like AI/ML, Cloud Computing, Ethical Hacking, C, C++, Java, Python, DSA (All Languages), Competitive Coding (All Languages), TCS, Infosys, Wipro, Amazon, DBMS, SQL and others

Checkout list of all the video courses in PrepInsta Prime Subscription

Checkout list of all the video courses in PrepInsta Prime Subscription