OS | Process Management | SRTF with processes contains CPU and IO time example 1 | RBR

[@harikrishnap8760]

i saw this video 5 times to get understood......but i could say at last is this is the best class!!

[@adarshr3490]

At t=7 there is a tie between remaining burst time of P1 and P3 but you have chose P3 because you have wrote the wrong remaining burst time at the moment of 8:15 in the video. So my question is under what criteria will we chose the next process to be processed ?

[@kiransharma1460]

I really love your videos and teaching ....thank you ..

[@hiddentalents6364]

sir I request you to add more topics like paging and segmentation, page replacement algorithms

[@tarunkumar-kz5xi]

at 6:17 in the video how to break the tie between 2 processes having same SRT . can you please explain what was the criteria used to continue scheduling P1 for one more unit? thanks

[@nns3322]

At 2:11 you said that p2 is the one with least burst time, p2 =3 and p1 =5. My question is, do we consider total burst time i.e BT+BT or just first BT for judging the smallest job? That is if only considering the first BT p2 will have 2 and p1 will have 3. The result will be same here in this question but in a different situation answer could have differed based on the above concept.

[@sayak]

it seems from what he is doing that he considers total BT and not individual.

[@robinahuja5972]

Thank you sir, this video helped me while my paper .!!

[@akshaygrao77]

Sir,In an earlier video, you had told that waiting time = time spent by process in ready queue waiting for CPU. But in the above example, IO burst time is also considered to be part of wait time. How is this valid? . Process neither is waiting for the CPU in that IO burst time nor it is in ready queue. So actually WT = TAT- BT. where BT = CPU BT + IO BT. Am I ryt?

[@sreejith.er_]

IO BT is actually IO WT. so it cant be part of BT. BT is CPU BT only.

[@rohitmishra2516]

at t=5, i think we should take P4 instead of P1 as according to SRTF P4 has the SRT.

[@sameerjoshi5798]

SRT dynamically changes

[@sumitkataria2565]

at t=5, p1 and p4 have same BT that is 3 but here tie breaker is AT and id no so we take p1 at t=5.

[@yuktisharma7345]

did we cannot take p4 in place of p1 when p4 is first arrive as they both have same brust time at that moment

[@satyendersharma221]

Thank u so much sir u really amazing teacher

[@anshghawri4689]

What is the source of such i/incorporated questions....book name or source pls!

[@diego.777ramos]

What is the bibliography you use for your videos? please

[@jiteshkumar3112]

asked in mid sem. examination in DTU... sad life :(

[@maitrayipande6795]

Can you explain same example using FCFS

[@divyadhone4557]

plz process creation and signal lecture bhi playlist me add karo

[@manikantsharma9921]

You said these kinda question never have asked in GATE, that is not correct. In GATE 2006 CS 2 questions had been asked for 2 marks each. May be in single set or different set i am not sure about set but they have been asked. One with Priority Scheduling algo. and other with SRTF algo. Check it once.

[@prachiagarwal0708]

Are we assuming we have infinite I/O devices. What will happen if we have only 1 I/O device? We will have to do all same things for I/O also?

[@soclh6638]

good shit bro

[@sidharthsiddu4948]

In this video named "SRTF with processes contains CPU and IO time example 1" There is problem with Process P1. It has run for only 2 time units and went to blocked state due to I/O. I think, it has to run 3 time units before getting blocked. Correct me if I am wrong.

[@RajKumar-hk9hn]

This was really very confusing.... Ufffgg I quit this....

[@ankurchauhan3455]

i think you block p1 before

[@chintulaal5409]

It's not that difficult..I understood it at the first go.

[@ANKITKUMAR-xe6fg]

some time increase 2 unit of time and some time 1 unit of time

[@poojakumari-shortcut]

It's too difficult