This is far the best explanation of round robin on UA-cam, simple and clear. Its worth noticing that quantum doesn't necessarily needs to be in seconds, but can be expressed in any time unit.
My god man! What a explanation! I'm from Brazil and I was trying to found a video that would help me to understand RR, and I have watched brazilian people trying to explain but it didn't work! You have saved my life! THANKS A LOT!
And even after 6 years this video was still need it. Like I really hope you are a professor or something, I wasn't able to understand for a good while RR scheduling but thanks to you I did it on 4 minutes like how CLEAR your explanation was, it definitely will be a pleasure if someone has you as their teacher or tutor because this really was a life or more like a test savior. Hopefully you get back to do some of these. Wish you the best and once again thank you for the explanation!
Thank you so much for the vid!! I am going to write a test tomorrow and that Algorithm wasn't explained well in my script. With your explanation I understood how it works. Thumbs up!
Because at time 3, P4 and P5 haven’t arrived yet (they come at 5 and 6 respectively - note the “AT” column in the table). So after P1 executes, the only processes asking for CPU time are P1, P2, and P3.
Because the P1 is the first one in the READY QUEUE. At time 3, P1 enters the READY QUEUE, P2 and P3 are already there, but P4 and P5 only enter that queue after because of their Arrival Time (AT)
look at arrival time. 1,2,3,5,6. after the third arrival time you go back to 1 because round robin is circular. So after 3 you can go back to 1 (1,2,3, (space to go back) 5, 6) He didn't explain it that well though.
+ricky orlando P1 was put after P3, because it had not finished working by that time. P1 needed additional 2 seconds to complete, so it was put back to queue after P2 and P3 were added to the queue(they were already waiting for their turn as P1 was executing). Also, P4 was not added after P3 simply, because it's time hadn't come then yet(it arrived 2 seconds later, after P1 halted).
i have a question for you. At the time of 3, P1 has already been completed and P3 also appears simultaneously, I think for this case, it will prioritize the process that is completed first. It translates into that P3 will be put after P1.
If the process terminates or changes its state to waiting during its attributed time quantum, the scheduler selects the first process in the ready queue to execute.
Good video! What program / software did you use to draw the table and the scheduling at 1:27 min of the video? I have difficulty drawing: / I await reply!
Thank for Video, but I have a question please. I would like to know if it is possible to Calculate Round robin Without time quantum. If yes? How i do ? Sorry, I cannot good talk English
Very..Clear n Perfect explanation..!If u could explain remaining Scheduling algorithms also it will be very helpful for us..Thank you..!Attractive attempt Sir..!
That's a question I was going to ask. Other tutorials that i saw, they started with P1, went through P2, P3, P4, P5 and then started the loop again with P1?
P1 enters the request queue after it has finished running for the duration of the time quantum (3 seconds). P4 and P5 enter the request after this point (at 5 and 6 seconds respectively). A queue is a first in first served data structure and will always serve the front of the queue. This means P1 is run after P3, before P4 and P5, as it is earlier in the queue.
+prasanna kumar Round Robin moves in FCFS (FIFO), meaning that it goes in order of arrival time. When P1 executed, three seconds had passed, and P2 and P3 had arrived by then. But P4 takes 5 seconds to arrive, and five seconds had not passed yet since the scheduling started, so P4 could not be used. Since Round Robin goes in FCFS, the cycle started again with P1 as the next process.
This is far the best explanation of round robin on UA-cam, simple and clear. Its worth noticing that quantum doesn't necessarily needs to be in seconds, but can be expressed in any time unit.
please reply me , if you get notified about my reply
if that happens do you just convert it to the same unit as the processes in the table? (second to minute etc)
quantum is a just a unit to measure time you can let it seconds,minutes,hours anything
agree a lot
Thanks for not being another Hindi tutorial. I seriously mean it.
the struggle is real
I was in the quest for some real English too!
seriously
What is that?
ikr i am so happy to find it in "REAL" english
it's been 8 years and this video still helps a lot of people like me! thanks for the simple clear cut example. Hope you are doing well! :))
I can't believe it. I was looking everywhere to figure out this algorithm and watching this video, it took only 4 minutes to understand it all. Nice!
Very simple yet detailed explanation. I now fully understand how I would implement this in C/C++ for my Operating Systems class. Thanks!
Hello do you have the codes in here? Can u send it to me. Appreciated a lot
Legendary explanation of Round Robin. Tomorrow is my exam, thank you for saving me a fair amount of points!
My god man! What a explanation! I'm from Brazil and I was trying to found a video that would help me to understand RR, and I have watched brazilian people trying to explain but it didn't work! You have saved my life! THANKS A LOT!
I have an exam tomorrow morning and this video just fixed all the confusion in like 3 minutes. I can’t thank you enough 🙏🏼😭
How was an exam 😂
I have exam tomorrow morning
Wow I have looked at several videos and read textbooks and I never understood it. I now understand it. Wow. My mind is blown. Thank you.
bro you explain it so simple but efective, i understund it in 10 seconds your good teacher
Nice. I was checking many channels for good lecture and wasted 20 to 40 min. U gave the idea in 4 min⚡⚡⚡
And even after 6 years this video was still need it. Like I really hope you are a professor or something, I wasn't able to understand for a good while RR scheduling but thanks to you I did it on 4 minutes like how CLEAR your explanation was, it definitely will be a pleasure if someone has you as their teacher or tutor because this really was a life or more like a test savior. Hopefully you get back to do some of these. Wish you the best and once again thank you for the explanation!
bro born just to help us and post this only video
Love how i learned more from this 5 min youtube video than my school who im paying thousands to attend…
Huge thanks for the example with time graph, table and definitions. It is much easier to understand something that is visualized.
Was struggling to understand this but not anymore. Simple and precise
Many thanks bro, the combination of incoming time and queue is killin it :)
thanks a lot ,the fact that you explained it within 5 min is the important thing here
Thank you so much for uploading this detailed video of scheduling using round robin algorithm. Best explanation of round robin so far 🙂
very good and quick explanation with a very straightforward example
I can surely say this explanation was way better than 19 mins video I learnt entire concept clearly !
Clear and simple explanation! It's absolutely easy to understand. THX U, Sir!
Finally, Someone Who speaks English! Excellent Explanation~
awesome video quick and precise delivered the concept within 4 min most other videos take 20 min saved me a lot of time thanks!
The best explanation for round Robin in youtube.. Thank you very much
Wonderful in 4 minutes I understood this... thank you so much u just gained a subscriber
Dude you saved me while preparing for my exam!
Awesome fantastic video really helps, my midterm is next week and this was the one I was struggling to learn.
You nailed it broo!
I try out many tutorials but not worth than you.Your teaching style is same as my university Mam!
Thank you so much for the vid!! I am going to write a test tomorrow and that Algorithm wasn't explained well in my script. With your explanation I understood how it works. Thumbs up!
best video on the subject for sure, better then my collage professor
Why p1 gets to be twice before p4 and p5 didn't even get one
Because at time 3, P4 and P5 haven’t arrived yet (they come at 5 and 6 respectively - note the “AT” column in the table). So after P1 executes, the only processes asking for CPU time are P1, P2, and P3.
By far the best explanation video on youtube!!!!!!
This is the best explanation of round robin ever better then my teacher at uni lol
BEST explanation on YT, thank you!
what will happen to P4 if its BurstTime be longer than 1 seconds? Will it go to queue or TQ will start from there? 3:15
why we put te 2 seconds of P1 again after P3 and not after P5?
Because the P1 is the first one in the READY QUEUE. At time 3, P1 enters the READY QUEUE, P2 and P3 are already there, but P4 and P5 only enter that queue after because of their Arrival Time (AT)
Tks for the quick explanation! You got to the point and super clear!
You just saved my semester
Thanks you , you literally saved me in last moment
i did not get the order, why after p3 you come back to P1? based in wich oder it works? by the way good accent and clear video. thanks
look at arrival time. 1,2,3,5,6. after the third arrival time you go back to 1 because round robin is circular. So after 3 you can go back to 1 (1,2,3, (space to go back) 5, 6) He didn't explain it that well though.
you would have done great in the UA-cam learning industry lol
hope you are doing great now
Great video and very good explanation! I have only one question. Why did you change from P3 again to P1 and not to P4?
+Savvas Yiannopoulos because P4 has arrival time 5
+Przemysław Rychlik can you give more explanation pls
+ricky orlando P1 was put after P3, because it had not finished working by that time. P1 needed additional 2 seconds to complete, so it was put back to queue after P2 and P3 were added to the queue(they were already waiting for their turn as P1 was executing). Also, P4 was not added after P3 simply, because it's time hadn't come then yet(it arrived 2 seconds later, after P1 halted).
thanks for the question btw :D
Awesome explanation, thank you for this.
correction : the avg waiting time for p3 should be
(6-3) + (15-9) = 3 + 6 = 9
u saved me, u explained in the most simplest way thanks!
i have a question for you. At the time of 3, P1 has already been completed and P3 also appears simultaneously, I think for this case, it will prioritize the process that is completed first. It translates into that P3 will be put after P1.
why we put p1 after p3 only?
Because P4 and P5 haven't arrived at that time yet
i think you are right... i have done this scheduling
@@boooost98 plz explain
If the process terminates or changes its state to waiting during its attributed time quantum, the scheduler selects the first process in the ready queue to execute.
Thank you for having this video. I understood it easily. Thumbs up!
Thank u so much for this helpful tutoriel , I finally understand it.
Thank you very much! Nice and simple explanation
you are awesome , this tutorial will help me in my exam.
I dont understand why was P1 put in queue after P1,P2,P3...i mean shouldn't it be queued at the end? after P4 and P5?
So simple and clear explanation. Thanks a ton
Good video! What program / software did you use to draw the table and the scheduling at 1:27 min of the video? I have difficulty drawing: / I await reply!
Try draw.io
Thank for Video, but I have a question please.
I would like to know if it is possible to Calculate Round robin Without time quantum.
If yes? How i do ?
Sorry, I cannot good talk English
Very..Clear n Perfect explanation..!If u could explain remaining Scheduling algorithms also it will be very helpful for us..Thank you..!Attractive attempt Sir..!
Post more videos your explanation is very clear
If P4 had a BT of 5, after P1 had finished, would P4 run for 1 or 3 seconds?
+Brad A. it will run for 3 seconds (TQ) and the remaining BT of 2 will be exected another time. P4 will go back in que after P3
thanks, my teacher was able to make this confusing...
clear and simple
Very clear and straight forward. Thank you!!!!!
Can you guys help me out?
How will you know when you are to go back to a process with a remaining burst time?
Thank you for clear explanation!
what if the arrival time of the first process is not zero?
why after the first p3 is p1 can you explain
Hi im confused why is p4 come after p1..because p4 hasn't started yet where p1 have? sorry for my bad english.
P1 gets rescheduled after 3s, P4 starts after 5s.
Can someone tell me y p1 came before p4???
Excellent explanation! Right to the point!
Holy crap I got something in 4 mins that my professor couldn't explain in 3 hours!
🤣🤣🤣🤣🤣
P3 = (6 - 3) + (15 - 9) = 6
should be 9, wrong calculation
i have a question: why does P1 get executed again after P3 and not after P5?
That's a question I was going to ask. Other tutorials that i saw, they started with P1, went through P2, P3, P4, P5 and then started the loop again with P1?
Because Process 1 Has a new Arrival Time of 3 and a CPU Burst of 2.
P1 enters the request queue after it has finished running for the duration of the time quantum (3 seconds). P4 and P5 enter the request after this point (at 5 and 6 seconds respectively). A queue is a first in first served data structure and will always serve the front of the queue. This means P1 is run after P3, before P4 and P5, as it is earlier in the queue.
what happens if time quantum is greater than burst time?
hello. how do you calculate the time quantum ?
Good job, very clear explanation thanks a lot!!!
how do i calculate depth of the Request Queue?
beautifull explanation thanks so much.
can you SAY why you took p1 second time in place of p4.reply me ASAP
+prasanna kumar Round Robin moves in FCFS (FIFO), meaning that it goes in order of arrival time. When P1 executed, three seconds had passed, and P2 and P3 had arrived by then. But P4 takes 5 seconds to arrive, and five seconds had not passed yet since the scheduling started, so P4 could not be used. Since Round Robin goes in FCFS, the cycle started again with P1 as the next process.
Pedro Gonzalez hhahahahahha genius
Great explanation. Thank you Sir.
very good explanation. real MVP
what a perfect video for explaination
Finally found a good explanation!!!...Thank you..
Found this useful, good job!
Great video and explanation! Thanks!
Is this premtive or non premtive?
Great explanation!
Great Explanation!
That was very helpful, thanks a lot!
How to find waiting time for Round robin
Man! YOU ARE MY SAVIOR!!!
why you used p1 after p3 and not p4?
Because P1 has a remaining Burst Time of 2 it goes back on queue behind P2 and P3 which arrive before P1 was able to finish its allotted Time Quantum
After P3 then P1 can anyone help me to explain why?
Thank you so much, it helped me a lot !!!!!!
so what is the answer?
Great video!
Thank you. It's very clear.
Hiii do u have a code?
Did you mean "ready queue"?
He probably did.
Yes I heard that term either...
Esay explanation...
Thank you so much
teach by example, super effective!
Thank you, great explanation!
And my doctor spent his two hours lecture explaining this...
Welp.. thats my Dad😀