Simple Way Of Process Scheduling In Operating System

Simple way of Process Scheduling in Operating System to maximize CPU utilization and minimize response time is written below.

Scheduling Criteria

Turnaround Time= Completion Time-Arrival Time

Waiting Time= Turnaround Time-Burst Time

Response Time=First Response Time-Arrival Time

Turnaround Time: Total amount of time spend by the process in the system.
Completion Time: Time at which process finishes its execution.
Arrival Time: Time at which a process gets into the ready queue.
Burst Time: Amount of time required by a process in CPU. It is also known as CPU time or Execution time of a process.

CPU Scheduling or Process Scheduling Algorithm

List of Useful process scheduling algorithm in operating system is

NOTES:
In First Come First Serve (FCFS) or First-in First-out (FIFO) and Round Robin process scheduling algorithm starvation is not possible.
Starvation: Undefined waiting time of a process to get CPU.

First Come First Serve (FCFS) or First-in First-out (FIFO):
Criteria: Arrival Time
Mode: Non Preemptive
Disadvantage: Shorter jobs can get stacked behind the long jobs.

Shortest Job First (SJF) or Shortest Job Next:
Criteria: Burst Time
Mode: Non Preemptive
Disadvantage: It can lead to starvation of process.

Shortest Job Remaining Time First (SRTF):
Criteria: Burst Time
Mode: Preemptive

Round Robin:
Criteria: Time Quantum
Mode: Preemptive

Another Topics of Operating System:
Basics of operating system