I'm at video 51 of the Operating Systems playlist and I just have to stop and say how grateful I am for this. This man does not miss a beat in his explanations. THANK YOU !!!
In a typical round-robin scheduling system, the decision of whether to place the preempted process or the newly arrived process first at the back of the queue depends on the specific implementation of the scheduling algorithm. There isn't a universally standardized rule for this, and different operating systems or schedulers may handle this situation differently. Here are two possible scenarios: Place Preempted Process First: The preempted process could be placed back in the queue before the newly arrived process. This means that the preempted process, which was already in the middle of its execution, gets another chance to continue from where it left off before the newly arrived process gets its turn. Place Newly Arrived Process First: The newly arrived process could be placed in the queue before the preempted process. This means that the system prioritizes the new arrival, allowing it to start execution before the preempted process gets another turn. in this lecture, they have taught for 2nd scenario only.
I'm struggling with process synchronisation and concurrency. I'm waiting for lectures on those topics. Not comprehensive but a little introductory with little explanation can really help me me out. By the way, in upcoming march, I will apply for interview at Neso Academy for Compiler Design Course.
Your videos are amazing for computer science students like myself taking courses in concurrent programming and operating systems. Thanks for all the help with your videos!
idk if I dont have enough sleep or if im too fckng dumb that I am not able to fully understand the subject. anyways, after P3 why P1 go in next instead of P4?
because till time 2 there was no process to put in ready queue, therefore scheduler put the p1 after p3 to complete the job, however at time 3 p4 has arrived and it had to be put in behind the p1 and it kept going like that.
Because p1 gets preempted at time 2ms and at that time p4 hasn't arrived (p4 arrives at 3ms) so p1 enters the ready queue and is placed after p3 and then at 3ms p4 arrives and is placed after p1..
after executing p1 in the first time p1 get a ready queue at time 2 and p3 gets ready queue at time 2 so the arrival time of p1 and p3 is the same so we execute p1 because the pid of p1 is 1 less than the pid of 3 which is 3
@Neso Academy 11:57 one thing I didn't understand that when p1 arrives the remaining time quantum was only 1unit due to process p3 voluntary releases itself from the CPU as it's execution is over. So it should execute for only 1 ms after it would again be preempted. Please clear my doubt
Sir..thank you for this video..and i get knowledge on this problem But i have a question....that is. Assume the following workload in a system: Process Arrival Time Burst Time P1 5 5 P2 4 6 P3 3 7 P4 1 9 P5 2 2 P6 6 3 Draw a Gantt chart illustrating the execution of these jobs using Round robin scheduling algorithm and also Calculate the average waiting time and average turnaround time Plz..plz..solve the problem
Sir? I have a question? That I've done by myself first but without the ready queue. Means I've got arrangement as p1,p3,p4,p1,p1,p2,p5,p2, p5 Is it correct if we don't follow the ready queue.?
I'm at video 51 of the Operating Systems playlist and I just have to stop and say how grateful I am for this. This man does not miss a beat in his explanations. THANK YOU !!!
Everything is so hard until you find a video by Neso Academy. Thanks a lot!
Honestly!!!👏🏻😂🔥
Everything becomes hard because of professor's poor explanation.
@@AvikNayak_ i always wonder how can they became professors?
Tomorrow is my os exam - bscit 🤗 i hope u will upload full course for other people
@@nesoacademy thanks 🤘😁
Same here. I find this playlist very helpful thanks guys.
Tomorrow is also mine Bscit and i am here now
And ur from smit
Just took a moment to applaud the hard work that has been put in making this awesome video!! Thanks a ton!!!💯👍🙏
6:25 tricky part: a pre-empted process gets behind a new process arriving at the same time that the first process is pre-empted ...
A comment you wrote 1 year ago helped a total stranger from the other part of the globe at 1 am in the morning
damn that thing i didnt got it
@@vladcristea8378 same happened with me today at exactly 1am in India
thank you man ,hope your doing good
thanks legend
I will never forget your contribution and efforts🙏🙏. Congratulation for getting golden button play 👏👏. You deserve it.
Oh my good God! This is so amazing. How you managed to perfectly explain this scheduling is just awesome! A big kudos, I must say, to Naso Academy.
In a typical round-robin scheduling system, the decision of whether to place the preempted process or the newly arrived process first at the back of the queue depends on the specific implementation of the scheduling algorithm. There isn't a universally standardized rule for this, and different operating systems or schedulers may handle this situation differently.
Here are two possible scenarios:
Place Preempted Process First:
The preempted process could be placed back in the queue before the newly arrived process. This means that the preempted process, which was already in the middle of its execution, gets another chance to continue from where it left off before the newly arrived process gets its turn.
Place Newly Arrived Process First:
The newly arrived process could be placed in the queue before the preempted process. This means that the system prioritizes the new arrival, allowing it to start execution before the preempted process gets another turn.
in this lecture, they have taught for 2nd scenario only.
yes even i thought same and if u watch gate smashers he explains 1st way so don't know which method is correct as different answers are coming
Man you are the best, i wasted my time for hours until i found your video
Very Clear explanation Big thumps up for you sir
the clock and alarm concept really helped understanding the algorithm clearly 👍🏻
I'm struggling with process synchronisation and concurrency. I'm waiting for lectures on those topics. Not comprehensive but a little introductory with little explanation can really help me me out.
By the way, in upcoming march, I will apply for interview at Neso Academy for Compiler Design Course.
Your videos are amazing for computer science students like myself taking courses in concurrent programming and operating systems. Thanks for all the help with your videos!
OH MY GODDDD literally nobody has explained this so well :)
Nice explanation , it's clear my doubt Sir
Thank you very much sir... In this pandamic situation these lecture help me a lot...
Hi, great video! thanks a lot. I have a question about round robin, why does it use a circular queue? can it be implemented using regular queue?
6:25 Important vip part: a pre-empted process gets behind a new process arriving at the same time that the first process is pre-empted.
your comment saved my mid sems
idk if I dont have enough sleep or if im too fckng dumb that I am not able to fully understand the subject. anyways, after P3 why P1 go in next instead of P4?
i cannot understand why p1 came after p3 in gantt chart
because till time 2 there was no process to put in ready queue, therefore scheduler put the p1 after p3 to complete the job, however at time 3 p4 has arrived and it had to be put in behind the p1 and it kept going like that.
Because p1 gets preempted at time 2ms and at that time p4 hasn't arrived (p4 arrives at 3ms) so p1 enters the ready queue and is placed after p3 and then at 3ms p4 arrives and is placed after p1..
Dimag kharab ho gya bhyiii
@@lyrical_kumaun.Mera kal paper ha aur ye ni aata baki sab aata😂
@@ShahbazKhan-pf3oo te obozhavam
thanks a lot, helped me understand for my project
after executing p1 in the first time p1 get a ready queue at time 2 and p3 gets ready queue at time 2 so the arrival time of p1 and p3 is the same so we execute p1 because the pid of p1 is 1 less than the pid of 3 which is 3
this video is better than sir Faisal Cheema's 1.5 hour lecture.
19:42 thanks a lot, crystal clear.
@Neso Academy 11:57 one thing I didn't understand that when p1 arrives the remaining time quantum was only 1unit due to process p3 voluntary releases itself from the CPU as it's execution is over. So it should execute for only 1 ms after it would again be preempted. Please clear my doubt
Sir..thank you for this video..and i get knowledge on this problem
But i have a question....that is.
Assume the following workload in a system:
Process Arrival Time Burst Time
P1 5 5
P2 4 6
P3 3 7
P4 1 9
P5 2 2
P6 6 3
Draw a Gantt chart illustrating the execution of these jobs using Round robin
scheduling algorithm and also Calculate the average waiting time and average
turnaround time
Plz..plz..solve the problem
Thank you sir you are just amazing
Awesome explanation
Great explained !!
sir you are angel !!!!!!!!!!!!!
Thank you 👍🏻
Sir? I have a question? That I've done by myself first but without the ready queue. Means I've got arrangement as p1,p3,p4,p1,p1,p2,p5,p2, p5
Is it correct if we don't follow the ready queue.?
What if Arrival Time starts from 1 instead of 0? will 0-1 in Gantt chart will be CPU idle state?
You are a legend!
best explanation
why wouldn't the gantt chart order be p1, p2, p3, p4 instead of p1, p2, p3, p1 at @8:06?
Average Waiting time = 5.8 ms
Average Turn-around time = 8.6 ms
Is it correct ?
yes, it is as also i got the same ans.
yes even i got the same answer
Same here
how did you find it can you write the steps
Welp im here to say thank u very much
whats happens when there is no time quantum given?
Make a video for FCFS in I/O requirements
what if there is a priority with round robin, should I consider it? I have got that kind of question in an exams
Hello sir.... I want all the PPT's of OS of your lecture . How can I get. I have exams to come need to prepare. Please do reply
Amazing sir
Thank you so much sir
Sir Upload all videos... please
your tutorial did not completed
My lecturer got PhD but u teach far better than him. 🤝
Why P1 come after P3??
What if the arrival time start from 1 ms
Thanks sir ..
Thankyou sir
My os exams is today 😥
I will send one question would you tell me the answer
Plz
Best one
avg=8.5
Is this playlist enough for gate cse sir?
You don't need "Ready Queue" to understand this. If you do, it just indicates that you suck at Mathematics.
super
❤
💥
Punyita wala ako maintindihan 6al
hahahahahahahahhaah
Naka graduate ka na po?
Kumalaala kumalala savesta
wala q maintindihan,, auko n maging bobo