First Come First Served Scheduling Scheduling
Policy Arrival Order
Execution Order Preemptive
Non-Preemptive Task

 

The process of determining the order in which tasks are executed by a computer system. Scheduling policy where tasks are executed based on their arrival order, prioritizing tasks that arrive first.
The sequence in which tasks or processes arrive at the system for execution. A set of rules or guidelines that dictate how a particular task or process should be carried out.
A type of scheduling where a task can be interrupted and moved out of the CPU before it has completed its execution. The sequence in which tasks or processes are actually executed by the system.
A unit of work or activity that needs to be executed by a computer system. A type of scheduling where a task cannot be interrupted and must complete its execution before another task can be executed.

 

Process Arrival Time
Execution Time Turnaround Time
Waiting Time Context Switching
Starvation Preemption

 

The time at which a process enters the system and is ready to be executed by the CPU. An instance of a running computer program that includes its current state and execution information.
The total time taken by a process from arriving in the system to its completion. The amount of time a process takes to complete its execution.
The process of saving and restoring the state of a process when it is interrupted for execution by another process. The total time a process spends waiting in the ready queue before being executed.
The act of temporarily suspending a process's execution to allow another process to run. A situation where a process is denied CPU time due to the presence of higher priority processes.

 

Burst Time Round Robin Scheduling
Backfilling Round Robin Process Scheduling
Time Quantum Scheduling Algorithm

 

A scheduling algorithm where each process is assigned a fixed time slice to execute before being moved to the back of the ready queue. The amount of time a process requires to complete its execution without any interruption.
A scheduling algorithm where each process is assigned a fixed time unit or quantum to execute before moving on to the next process in a circular manner. A scheduling technique where a job is allowed to run if resources become available before its designated start time.
A method used to determine the order in which processes are executed by the CPU based on certain criteria such as priority, fairness, and efficiency. The fixed time unit allocated to each process in a Round Robin scheduling algorithm.