Scribd
Upload
6 views

TOPIC-SJF-and-FCFS-Scheduling-Algorithm (1)

Uploaded by

sanchayitaghosh376
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
6 views

TOPIC-SJF-and-FCFS-Scheduling-Algorithm (1)

Uploaded by

sanchayitaghosh376
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 4

TOPIC: SJF and FCFS Scheduling Algorithm

SUBMITTED BY

<Your Name>

GROUP MEMBERS:

SANCHAYITA GHOSH (IT/22/053)

RIYA BANIK (IT/22/055)

SINCHITA DAS (IT/22/066)

SHIVANI SARGAR(IT/22/049)

RIYA YADAV (IT/22/023)

ADITI SINGH (IT/22/022)

AKASH KONER (IT/22/060)


Shortest Job First (SJF) Scheduling
SJF scheduling prioritizes processes with the shortest burst time, aiming for maximum throughput and minimal waiting and
turnaround times. However, predicting burst times accurately is challenging, making this algorithm difficult to implement in real
systems.

Advantages Disadvantages

SJF maximizes throughput SJF suffers from the


by minimizing the problem of starvation,
average waiting and where processes with
turnaround times for longer burst times may
processes. never get scheduled. It's
also not implementable in
practice because the
exact burst time for a
process is unknown
beforehand.
FCFS (First-Come, First-Served) Scheduling

FCFS is the simplest CPU scheduling algorithm. It allocates the CPU to the process that requests it first, using a FIFO queue. FCFS is non-preemptive, meaning a process keeps the CPU until it completes its task or re

1 Arrival Time (AT)


The time at which a process enters the ready queue.

2 Burst Time (BT)


The time a process needs to complete its execution.

3 Completion Time (CT)


The time at which a process finishes execution.

4 Turnaround Time (TAT)


The total time from arrival to completion: TAT = CT - AT.

5 Waiting Time (WT)


The time a process spends waiting in the ready queue: WT = TAT - BT.

6 Response Time (RT)


The time from arrival to the first time the CPU is allocated to the process.
FCFS Scheduling: Advantages and Disadvantages
Advantages Disadvantages

• Easy to implement • Convoy effect: Long burst time processes can block
• Fair scheduling shorter ones.
• Not suitable for interactive systems
• Non-preemptive, so long tasks can delay others.

You might also like