FCFS: First Come First Serve Scheduling Algorithm

First Come First Serve Scheduling Algorithm

What is FCFS (First Come First Serve) Scheduling Algorithm?

FCFS(First Come First Serve) executes the process one by one in the order to first come first execute. FCFS is one type of scheduling algorithm which helps to get more efficiency for the processor to execute all the processes. FCFS is the best, simple and easiest scheduling algorithm among all the scheduling algorithm.


In FCFS the processes which request for the CPU first that process executes first and this all processes allocation is managed by FIFO which means first in first out. Full form of FCFS is First Come First Serve.


Let’s Understand in easy words suppose if you have 4 task means four processes to execute and that four processes are P1, P2, P3 and P4

If the process P1 comes first to the processor then it executes first then other remaining processes.


Example of FCFS Scheduling Algorithm


Let’s understand more suppose if you are standing in a movie ticket line to buy a movie ticket then that person gives ticket one by one to then who comes first so I hope you understood the concept of FCFS.

Characteristics of FCFS method


1. It supports pre-emptive and non-preemptive scheduling algorithm.

2. The processes are always executed in a first come first serve manner.

3. It is the best, simple and which easiest scheduling algorithm.


Advantages of FCFS

1.Easy to implement

2.Simplest  among all the scheduling algorithm

Disadvantages of FCFS

 

1.It is a non-preemptive scheduling algorithm so it can’t release 

the CPU until it finishes the execution of the process

2.The AWT(Average Waiting Time) is high.

3.Every process needs to wait there is no difference between small in a big process.

Conclusion


Definition: FCFS executes the process one by one in the order to 

first come first execute.

FCFS is the best and easiest scheduling algorithm.

Full form of FCFS is First Come First Serve.

Reactions

Post a comment

0 Comments