Shortest Job First Scheduling (Solved Problem 1)

[@neel_artstrong]

The algorithm shown here is Shortest Remaining Time First (SRTF) not Shortest Job First (SRF). In description it's written that both are same which is not true. SJF is a non-preemptive algorithm while SRTF is preemptive at arrival. I am referring Operating Systems Internals and Design principle by William Stalling. There may be a mistake due to very similar names.

[@PriyankaSingh-pn8xv]

Yes... Right... It is SRTF not SRF

[@rometvinnal7035]

This should be the pinned comment.

[@shuyangnie2446]

well, shortest job first with preemption is the same as shortest remaining time first

[@adityaprasad1574]

Yes bro you are right....He taught us wrong.....I had also verified it from books,professors,batchmates..........
Padhane nahi ata ....thik se padhaya kro.....thoda sa ke liye confusion bhar jata hai😠

[@anmolnegi-vt2kb]

Also he said in previous lecture that preemptive SJF is sometimes called SRTF

[@chrismalingshu]

Sir, I understand what you taught very clear. I applied it to solve my test questions and my lecturer said it was wrong. With tons of evidences & references, he still insisted that my solution is WRONG. Almost everyone in the class solved it by referring to ur video.
How a frustrating learning process :( Anyway, I believed you are the right one.

[@ramak885]

keep learning

[@sabahsamwatin]

I think the one he showed in this video is for preemptive scheduling which are SRTF and Round Robin. The non-preemptive scheduling are SJF and FCFS. SJF and FCFS are solved in the same way. His FCFS video is correct. This video should be fixed.

[@kbbadhri9889]

Same bro 11:58 😊

[@yusen-t_t9872]

Just wish my professor could teach like this...

[@greythirdeye1714]

I like his voice... Soft and fluent english 🧡

[@aryanali574]

@@greythirdeye1714 hour 6ho 0yi0h

[@giannawilliams7037]

you guys are the reason im gonna graduate college

[@kbbadhri9889]

Did you graduate college?

[@pranavbadhe6489]

Just wish my professor could teach like this.........

[@sairajdas6692]

Excellent explanation!

[@lofiking6033]

This is not SJF algorithm. This is Shortest Remaining Time First algorithm. In case you are wondering what is the correct SJF, when a proccess starts, you dont compare any proccess that comes next, but instead let it finish no matter what. Correct your video's title or the description, because it misleads students.

[@nilawmanandhar8412]

Sir the title is bit confusing as it is Shortest Remaining Time First (SRTF) or preemptive SJF not just Shortest Job First (SJF) as the initial thing that comes in mind after hearing SJF is non-preemptive because what you are doing here is preemptive scheduling but generally SJF is non-preemptive in arrival

[@Jatish.M]

i am also having the same doubt

[@naughtyjiyansh533]

Preemptive SJF is called the SJRTF

[@mdkamrankhan4032]

Very good explanation. Thank you Sir.

[@ayushiydvKG]

SJF and SRTF are different. SJF holds for preemptive mode while SRTF holds for non-preemptive process (arrival time)

[@lolz8930]

This was extremely clear and helpful. Many thanks.

[@proteanguy3411]

Sir you should write in title it's preemptive shortest job first 😑

[@CSKAASIPRASANTHA]

SJRT is the pre-emptive form of SJF

[@shade5848]

hey! I have a question. how do I calculate waiting time if (for example) P1 was 3 times processed?

[@jinkangshuai4468]

in my opinion ,totalwaiting time- total first and second excited time -arrival time; total waiting time =the waiting time after arrival +second waiting time and third waiting time

[@Unknowns330]

I think your information is incorrect for the fact that sjf is non preemptive meaning the process is not stopping until completion sk p1 get execution untill finish and then apply short job first

[@elmargentertainment5683]

you are great!

[@mohan67662]

Sir please explain OOPS concept...

[@sitanshubhugun8219]

what if the arrival time is the same?

[@unlockwithjsr]

Hello sir, I think P4 intrerrupts P3 since 5 is less than 6

[@amritarao8514]

P4 COMES AT 8 SECONDS, THAT TIME P3 ALREDY EXECUTED 2 SECONDS SO REMAINING TIME IS 4 SECONDS , SINCE 4

[@monicamukherjee3758]

Shortest Remaining Time First Algorithm is used in this case as in the question it is asked to do so. SRTF and SJF are not same. If one uses SJF then P4 will interrupt P3 but since SRTF is used P3 will continue.

[@PKMKB93000]

Sir here if we calculate TAT for P1 it is coming out to be 27 using (CT-AT) formula but when we are calculating WT using (TAT - BT) formula then WT is coming different as compared to (TWT- Execution previous in millisecond - AT) formula. Theoretically TAT should be 27 only

[@arashpardeepsingh1551]

Sir how these actually happens in cpu how it knows or estimate the burst time of the process

[@DolaLado]

Thank you.

[@PaAGadirajuSanjayVarma]

Thank you so much sir

[@kunjupulla]

You did not cover response time

[@WESLEYMANOMANO]

thank u sir man

[@OurProblemsOurSolutions]

Nice video

[@tajudeenlisa8730]

Excuse me sir since p4 has a smaller burst time than p3 why didn't it come first...

[@PlRATE]

5:56

[@juliuspinto5031]

There should have been idle time in between p2 and p4. P3 will never be put into process until p4 has finished processing.

[@thomasshelby1093]

​@@juliuspinto5031so which one will come first p3 or 04

[@greythirdeye1714]

Sir how can i deal the theory part of OS??

[@trendtidetv528]

it is for preemptive and u solve it for non preemptive schedeuling

[@HayaAB]

Grateful👍👍

[@asfandi69]

Sir hurraira ny to aesy nai krwaya

[@riyajacey9462]

Helpful

[@dhanushsivajaya1356]

Thankyou sir

[@kawsar_sagor]

Its not SJF

[@johnpaulduavis8097]

Thank you

[@SohaAhmed-ek4nt]

Answer = 5.5

[@mr.gegenpress7750]

this is not SJF 😅

[@vrupesh8080]

NICE

[@rittushsarkar5943]

SIR IT'S YOUR MISTAKE THAT SHORT JOB FIRST SCHEDULING IS A NON-PREEMTIVE MODE AND IN THIS MODE EACH PROCESS IS EXECUTED UNTIL IT FINISHED COMPLETELY.........

[@nysschan]

6:03

[@seyyedrizmy4732]

Bruh this is STRF

[@robertocastillo7320]

di araival taims

[@appjosi3345]

Horrible video!!!

[@narimanvatankhah1269]