OPERATING
SYSTEM CONCEPT
- ASSIGNMENT
NAME : AMBER NAOMI
FERNANDES
ROLL NO : 20801
TOPIC: FIRST IN FIRST OUT
FIRST IN, FIRST OUT
FIRST
F
FIFO
I
IN
F
FIRST
O
OUT
Scheduling Algorithms: First In ,
First Out (FIFO)
• “Run until Done:” FIFO algorithm
• In the beginning , this meant one program runs non–preemtively until it is finished(including any
blocking for I/O operations)
• Now , FIFO means that a process keeps the CPU until one or more threads block
Scheduling Algorithms: First In , First
Out (FIFO) PRO ARRI BUR COM TUR WAI
EXAMPLE : Calculate average waiting time CESS VAL ST PLET N TING
TIM TIM ION ARO TIM
E E TIM UND E
E TIM
E
P1 2 6
P2 5 3
P3 1 8
P4 0 3
P5 queue.
ARRIVAL TIME – Time at which the process arrives in a ready 4 4
BURST TIME – Time required by a process for CPU execution.
COMPLETION TIME – Time at which process completes it’s execution.
TURN AROUND TIME – Time difference between completion time and arrival time.
WAITING TIME – Time difference between turn around time and burst time .
Scheduling Algorithms: First In ,
First Out (FIFO)
SOLUTION :
PROCESS ARRIVAL BURST COMPLETI TURN WAITING
TIME TIME ON TIME AROUND TIME
TIME
P1 2 6 17 15 9
P2 5 3 24 19 16
P3 1 8 11 10 2
P4 0 3 3 3 0
P5 4 4 21 17 3
GANTT CHART
0 3 11 17 21 24
P4 P3 P1 P5 P2
Scheduling Algorithms: First In , First Out
(FIFO)
AVERAGE WAITING TIME = 9 + 16 + 2 + 0 + 13
= 40
= 8
THANK YOU
