Shortest Job First | Scheduling Algorithm | Operating System
Hello and welcome you all to this new video. So SJF or Shortest Job First is also a CPU scheduling algorithm. As the name suggests it prioritizes scheduling based on the burst time. So the process that needs less execution time will be scheduled first. It significantly reduces the average waiting time problem that we face in first come first serve scheduling algorithm. It is a solution on convoy effect caused in FCFS. This algorithm is also non pre-emptive once a process starts its execution, it won’t leave until it completes its execution.
Watch the complete video to understand it completely.
Regards
Video Chapters:
Introduction- 00:00
Concept Overview- 01:27
Example/Problem- 02:15
Advantages/disadvantage- 05:25
Starvation- 06:32
Outro- 08:10
FCFS First Come First Serve: • First Come First Serve (FCFS) | CPU S...
CPU Scheduling Playlist: • CPU Scheduling
If you are new to the channel or returning after long time definitely check out my other videos and playlists too.
Follow these below links.
If you want to watch videos on operating system concepts use the links below:
Deadlock - Operating System | Playlist: • Deadlock - Operating System
Process - Operating System | Playlist: • Process - Operating System
Types of Operating System | Playlist: • Types of Operating System.
If you have not watched my previous videos on Database and DBMS concept click playlist link below:
Dependencies in DBMS: • Dependencies in DBMS
Normalization & Normal Forms | Playlist: • Normalization & Normal Forms
Keys in DBMS | Playlist: • Types of Keys | DBMS
Database and DBMS | Playlist: • Database & DBMS
Other videos on the channel:
What is compiler?: • What is Compiler | Short and Simple E...
If you find my videos helpful and if the videos help in clearing your concepts, like the video, share it with your friends, subscribe the channel and press the bell icon. :)
#SJF #SchedulingAlgorithms #OperatingSystem
