First Come First Served (FCFS)

Description

First come, first served (FCFS) is an operating system process scheduling algorithm and a network routing management mechanism that automatically executes queued requests and processes by the order of their arrival. With first come, first served, what comes first is handled first; the next request in line will be executed once the one before it is complete.

Let's take a look at how FCFS process scheduling works. Suppose there are three processes in a queue: P1, P2 and P3. P1 is placed in the processing register with a waiting time of zero seconds and 10 seconds for complete processing. The next process, P2, must wait 10 seconds and is placed in the processing cycle until P1 is processed. Assuming that P2 will take 15 seconds to complete, the final process, P3, must wait 25 seconds to be processed. FCFS may not be the fastest process scheduling algorithm, as it does not check for priorities associated with processes. These priorities may depend on the processes' individual execution times.

Example & Simulation

Example #1

Process Arrival Time Burst Time
P1 5 0
P2 4 2
P3 3 4
P4 6 6
Run Simulation

Example #2

Process Arrival Time Burst Time
P1 8 1
P2 5 1
P3 2 7
P4 4 3
P5 2 8
P6 4 2
P7 3 5
Run Simulation

Try It Yourself!

PROCESS
Process Arrival Time Burst Time
P1
Add Row
Run Simulation

0

Process Remaining Waiting Turnaround Status
Print Result

Process Waiting Turnaround