Shortest Remaining Time First (SRTF or preemptive SJF) with example | Telugu

No video

Shortest Remaining Time First (SRTF or preemptive SJF) with example | Telugu | Giridhar

Рет қаралды 46,137

Күн бұрын

In this video I have discussed about Shortest Remaining Time First (Shortest Job First criteria Preemptive) CPU scheduling algorithm with example
Previous video links
Process State Diagram in OS
• Process State Diagram ...
FCFS algorithm with example
• First Come First Serve...
FCFS algorithm with 2nd example
• First Come First Serve...
SJF algorithm criteria Non-preemptive with example
• Shortest Job First(SJF...

Пікірлер: 33

@sripujitha_14 Жыл бұрын

Very very nice and clear explanation annayya and ur not wasting our time by saying too much intro about channel

@kgclassroom9753 Жыл бұрын

Thank you so much 🙂 Chellemma, keep watching

@bhavanianupoju Жыл бұрын

Your explanation is very good sir

@kgclassroom9753 Жыл бұрын

Thank you very much

@sailajamandapalli2119 Ай бұрын

Thanks bro it's very clear 😊

@hanumantharaochandu87 Жыл бұрын

Super bro chala clarity ga chepparu

@kgclassroom9753 2 ай бұрын

Thank you brother

@sriharipamidimarri7314 Жыл бұрын

Baga cheppav bro baga ardham indhi

@kgclassroom9753 Жыл бұрын

Thank you Brother

@krishnaveni4986 Жыл бұрын

Nice explanation brother.Thank you it is useful to me

@kgclassroom9753 Жыл бұрын

Thank you sister

@meghanadasari-yw9ci 3 жыл бұрын

Thanks u so much sir nice explanation....

@kgclassroom9753 3 жыл бұрын

So nice of you

@satyanarayana4023 11 ай бұрын

At 2.15 seconds video ur confused and started saying this 4 is not smaller..comparing with upcomming times..how can u guess..that comparison should not be made, at 5.06 second u accepted ur mistake that still not arrived should not be compared though 2 is there.. only from available only need to compare...

@janapamulaprabha7860 Жыл бұрын

But here premptive is called shortest remaining time first algorithm know!?

@Deshamuduru Жыл бұрын

Bro difference between SJF and STRF chopandi bro i totally confuse

@LetusReview04 2 жыл бұрын

Bt values random ra vesukovala leda ela find cheyali bro

@GigiGirl-kx6bl 10 ай бұрын

Sem lo kuda same ealna rai vacha

@kadapalathika 7 ай бұрын

😊

@namasivayachalla6350 3 жыл бұрын

Sir meru arrival time 0,1,2,3 ala line wise ga tiskunaru kada mari 0,2,3,4,5 ala unte ela cheyali

@kgclassroom9753 3 жыл бұрын

0,2,3,4,5 ila unte first 0 tho start chesi 2 units execute chesaka then arrival time 2 consider cheyali. AT 2 daggara BT shortest job aite then new process ki switch avvali. Otherwise continue with AT 3...

@namasivayachalla6350 3 жыл бұрын

@@kgclassroom9753 ok thanks

@anirudhshankarkhedker4400 3 жыл бұрын

bro sjf preemptive lo ae type example ki ayina 1 millisecond time interval ae teesukovaccha leda aa problem arrival time batti teesukovala?

@kgclassroom9753 3 жыл бұрын

ye example ayina 1 millisecond time interval teesukovachu. but next arrival time ee 1ms lo vaste ok ledante 2ms teesukovali, adi shortest job aite present process preemption apply chesi next process schedule cheyali.

@anirudhshankarkhedker4400 3 жыл бұрын

@@kgclassroom9753 THANK YOU BRO

@satyanarayana4023 11 ай бұрын

If arrival times are random like 0 2 5 6 9.. then u cannot execute for 1 second

@Manoj_Kumar03 10 ай бұрын

Then 1 comes in idle cpu

@HattiMamatha-hg7yq 4 ай бұрын

Akkuva length chesi cheptunnaru

@jithendrasaikumar5987 3 жыл бұрын

How to know the given problem is to be solved by preemptive or non preemptive

@kgclassroom9753 3 жыл бұрын

In the question paper they will mention whether you need to apply Preemptive or Non-preemptive method using SJF alg. Or one more suggestion if they ask you to apply SJF then you apply Non-preemptive SJF otherwise if they ask to apply SRTF or SRTN then you proceed with SJF with Preemption.

@jithendrasaikumar5987 3 жыл бұрын

@@kgclassroom9753 thank u sir