Shortest Job First (SJF) - Non Pre Emptive CPU Scheduling Algorithm - Operating Systems
HTML-код
- Опубликовано: 7 фев 2025
- Support Simple Snippets by Donations -
Google Pay UPI ID - tanmaysakpal11@okicici
PayPal - paypal.me/tanmaysakpal11
--------------------------------------------------------------------------------------------- In this Video Tutorial we will Study and learn the working of Shortest Job First - Non Pre Emptive (SJF). SJF as the name suggests is based on the principle of shortest job first, this essentially means the the process that has the shortest burst time will be processed first. Also this algorithm is Non Preemptive in nature which means that once the CPU starts executing one process it cannot pause or stop it in between and has to completely finish that process before it can move to the next smallest process.
Another variation of SJF is SRT which is shortest remaining time which is SJF with pre-emption.
First Come First Serve (FCFS) CPU Scheduling Algorithm: • First Come First Serve...
Shortest Remaining Time (SRT) CPU Scheduling Algorithm : • Shortest Remaining Tim...
Round Robin CPU Scheduling Algorithm (RR) : • Round Robin CPU Schedu...
Priority Based CPU Scheduling Algorithm : • Priority Based CPU Sch...
Simple Snippets Official Website -
simplesnippets...
Simple Snippets on Facebook-
/ simplesnippets
Simple Snippets on Instagram-
/ simplesnippets
Simple Snippets Google Plus Page-
plus.google.co...
Simple Snippets email ID-
simplesnippetsinfo@gmail.com
For Classroom Coaching in Mumbai for Programming & other IT/CS Subjects Checkout UpSkill Infotech - upskill.tech/
UpSkill is an Ed-Tech Company / Coaching Centre for Information Technology / Computer Science oriented courses and offer coacing for various Degree courses like BSc.IT, BSc.CS, BCA, MSc.IT, MSc.CS, MCA etc.
Contact via email /call / FB /Whatsapp for more info
email - upskillinfotech@gmail.com
We also Provide Certification courses like -
Android Development
Web Development
Java Developer Course
.NET Developer Course
![Felix "Unfair" | [Stray Kids : SKZ-PLAYER]](http://i.ytimg.com/vi/Oswujxm2Ag0/mqdefault.jpg)
Hey Guys, if you want many more such tech educational videos on this channel then please support me by subscribing to this channel & also share it with your friends ✌
You are good at explaining things .thank you
Thanks brother for the videos. You saved my semester.
one advise- reduce the sound of welcome tune in your videos.
Thank you for the compliment buddy. And yes I'll surely keep the volume low. In some of my old videos including this one I didn't know how to equalize the audio levels. But now in more recent videos I have leveled them properly 😇
Please do share these videos with your friends and contacts bro, that will be the biggest help you can do for our channel 😇✌️
Thankyou so much. These videos are honestly very helpful. 🙏😊
+Aakanksha Devgan thank you for the positive response ma'am. Do share the videos with your friends and contacts 😊
this is so helpful and needed , thank you so much
Clear and nicely explained
You're a life saver❣
Perfectly Explained
Thanks buddy 😇✌️
Do share the video with your friends as well 😇
That'll be the best help and support ✌️
Thank you. You helped me a lot
This was so perfect
Thank you a lot bro, you saved me a lot of time.
Most welcome buddy. I would request you to please share the video with your friends and contacts 😇😋
Thanks Sir, it really help me.
You're always welcome buddy. Please share the video with your friends and contacts 😇
Good job, helped a lot. Thank you.
Thank you for the positive response. Please do share it with your friends and contacts so that even they get help ✌️😇
Thank you
Thank you soo much🙏, helped at lot really helpful for me, clearly nd perfectly explained 👍👍😊
Thank you so much buddy 😇. Please do share the video with your friends and contacts too ✌️ that'll be the best help and support for the channel ✌️
it was quite helpful thank you soo much ^_^
Thank you for the positive response. Do share the video with your contacts. :)
Sneha Chavan i love you
Thank You..!
Welcome :)
the music and the voice not at the same pitch. Nice video
Sorry for the mismatch of audio level. Will take better care in future ✌
How come you didn't start with P2 instead of P0 in the Gnatt Chart? Considering P2 has the lowest burst time.
Good question Chris, well I have exactly explained why processor starts with P0 instead of P2 or P2 or any other process which has lowest burst time.
See this is a Shortest Job first algorithm BUT it is NON-PREEMPTIVE which essentially means, once processor starts processing any process or job, it can't stop till it finishes it.
Now since P0 was the very first process to arrive at time t = 0, CPU started processing and as I mentioned once it starts processing it it can't stop.
Basically at the very beginning when time t was 0 only one process was arrived that is P0 right ? so CPU cant compare it with other processes for shorter burst times since there arent any. I hope you get the idea here ? 😇✌
it is gantt chart or gnatt chart????
Thnxx bro if possible upload deadlock video
Hey, will surely try to make a video on that topic. any specific topic under deadlocks ?
Deadlock avoidance Bankers algorithm safe-unsafe and more
What to do when my Turn around time is less than Burst time??
Waiting time is going in minus 😯
It can't be less than burst time ever. By definition - Turnaround time (TAT) is the time interval from the time of submission of a process to the time of the completion of the process. It can also be considered as the sum of the time periods spent waiting to get into memory or ready queue, execution on CPU and executing input/output.
Make video also on pre empitive 😢
hey , what if we zero as arrive time for all process?
then just do it based on the burst time, its easier
goated
2:00
the intro sound is really loud
hey what's the song on the prefix?
intro music too loud
063 Kamren Stream