Tasks States in OS

When we talk of tasks in a operating system, we must be aware of how these tasks/processes/threads are given to the processor to execute. This process of selecting the next task to execute based on an particular strategy or algorithm is called Scheduling.

Scheduling algorithms can be of many types, namely First-Come, First-Served (FCFS) Scheduling, Shortest Remaining Time Scheduling, Round Robin Scheduling, Pre-emptive Scheduling, Shortest Job First Scheduling and Priority Scheduling.

Based on such algorithms, tasks are assigned different states to manage them

Like Ready, Running, Terminated, Blocked or Swapped Out into memory, Suspended to Wait or In-Queue.

All this is determined by the Kernel's scheduler.