First Come First Served (FCFS) is a Non-Preemptive scheduling algorithm. FCFS follow the FIFO (First In First Out) rules that means when a process comes to CPU for executing, CPU executes the process without checking anything like in primitive scheduling algorithm. In other words, we can say that the First process will be executed either the execution time of the first process is higher than other or until the first process executing another process should wait for their turn. Below is the Brief description or Q&A of FCFS Non-Preemptive scheduling algorithm.
1. What is First Come First Served (FCFS) Scheduling Algorithm?.
2. How to Calculate Turn Around Time?.
3. How to Calculate Waiting Time?.
What is First Come First Served (FCFS) Scheduling Algorithm?.
First Come First Served (FCFS) is a Non-Preemptive scheduling algorithm for process execution in an operating system and easy to understand and poor performance (waiting time is higher), If the first process is taking time for execution than until finish first process rest of the process has to wait.
How to Calculate Turn Around Time?.
Turn Around Time = Completion Time – Arrival Time
With the help of this formula, we can calculate a Turn Around Time of all process in Queue.
How to Calculate Waiting Time?.
Waiting Time = Turn Around Time – Burst Time
This formula is used for calculating the waiting time for rest of process.