Scribd
Upload
249 views3 pages

FCFS: First Come First Serve Scheduling in OS: Example of FCFS: Buying Tickets at The Ticket Counter

FCFS is a non-preemptive scheduling algorithm where processes are executed in the order that they arrive. It is simple to implement but can result in poor performance and high waiting times due to processes waiting for long bursts. An example is provided showing the calculation of waiting times and turnaround times for 4 processes under FCFS scheduling.

Uploaded by

Mohammed Razid Lathif
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
249 views3 pages

FCFS: First Come First Serve Scheduling in OS: Example of FCFS: Buying Tickets at The Ticket Counter

FCFS is a non-preemptive scheduling algorithm where processes are executed in the order that they arrive. It is simple to implement but can result in poor performance and high waiting times due to processes waiting for long bursts. An example is provided showing the calculation of waiting times and turnaround times for 4 processes under FCFS scheduling.

Uploaded by

Mohammed Razid Lathif
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

FCFS: First Come First Serve Scheduling in OS

FCFS is a non-preemptive and preemptive scheduling


algorithm that is easy to understand and use.
In this, the process which reaches first is executed
first, or in other words, the process which requests
first for a CPU gets the CPU first.
Example of FCFS: buying tickets at the ticket counter.
FCFS is similar to the FIFO queue data structure. In FCFS,
the element which is added in the queue first will leave
first.
FCFS is used in Batch Operating Systems.
Characteristics of FCFS Scheduling

The characteristics of FCFS Scheduling are:


1. FCFS is simple to use and implement.
2. In FCFS, jobs are executed in a First-come First-serve
(FCFS) manner.
3. FCFS supports both preemptive as well as non-preemptive
scheduling algorithm.
4. FCFS is poor in performance due to high waiting times.
Advantages of FCFS
The advantages of FCFS are:
1. Easy to program
2. First come, first serve
3. Simple scheduling algorithm.
Disadvantages of FCFS
1. Because of non-preemptive nature, the problem of
starvation arises.
2. More Average waiting time.
3. Due to its simplicity, FCFS is not effective.
4. FCFS is not the ideal scheduling for the time-sharing
system.
Example of FCFS Scheduling
In the following example, we have 4 processes with process ID
P0, P1, P2, and P3.
The arrival time of P0 is 0, P1 is 1, P2 is 2, and P3 is 3. The
arrival time and burst time of the processes are given in the
following table.
The waiting time and Turnaround time are calculated with the
help of the following formula.
Waiting Time = Turnaround time – Burst Time
Turnaround Time = Completion time – Arrival time

Process Arrival Burst Turnaround Waiting


Completion Time
ID Time Time Time Time

P0 0 6 6 6 0

P1 1 8 14 13 5

P2 2 10 24 22 12

P3 3 12 36 33 21
Average Waiting Time = 0+5+12+21/4
= 38/4
= 9.5 ms
Average Turnaround Time = 6+13+22+33/4
=74/4
= 18.5 ms

You might also like