CPU Scheduling

Algorithms

N A M E : P U N E ET P U RO H I T               D AT E : 0 3 - 0 9 -
2 02 1  
RE G N O . : 20 B CE0 1 9 1                      S LO T :
L3 5 + L 36
FA C U LT Y : M A N O O V R
First Come First Serve Scheduling (FCFS)
-  In this algorithm we assign CPU to the process which comes first
I.e., whose arrival time is first. If two process have same arrival
time, then which is first written is considered.
- It is one of the simplest and easy to implement algorithm.
- It supports both preemptive and non-preemptive mode of
scheduling.
- Performance is poor and average waiting time is quite high.
- Short Jobs can get stuck behind long jobs.
 Shortest Job First Scheduling (SJF)

- In this algorithm , out of all the process with smallest burst time is
allocated to the CPU. If two process having same burst time, then it
follows first come first serve technique.
- It improves job output by offering shorter jobs, which should
be  executed first, which mostly have a shorter turnaround time.
- It works in both preemptive and non-preemptive modes.
- SJF is frequently used for long term scheduling in batch systems.
- Provides with the optimal average waiting time .