Round Robin Scheduling - Solved Problem (Part 1)

Operating System: Solved Question on Round Robin Scheduling Algorithm in OS
Topics discussed:
1) Formation of Gantt Chart for Round Robin Scheduling Problems when Arrival Times are given.

Music:
Axol x Alex Skrindo - You [NCS Release]

#OperatingSystemByNeso #OperatingSystem #RoundRobinScheduling #SchedulingAlgorithms #os

[personaliTia]

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 !!!

[Xavierpng]

Tomorrow is my os exam - bscit 🤗 i hope u will upload full course for other people

[jayachandra]

Everything is so hard until you find a video by Neso Academy. Thanks a lot!

[trywellwashington]

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 ...

[vinayaksharma-ysip]

Just took a moment to applaud the hard work that has been put in making this awesome video!! Thanks a ton!!!💯👍🙏

[mrityunjaypandey]

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.

[programminginfo]

I will never forget your contribution and efforts🙏🙏. Congratulation for getting golden button play 👏👏. You deserve it.

[adediranoreoluwa]

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.

[ganeshk]

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.

[VitrogPrasina]

Man you are the best, i wasted my time for hours until i found your video

[NikitaNair]

OH MY GODDDD literally nobody has explained this so well :)

[randomvideos]

Very Clear explanation Big thumps up for you sir

[vedantdesai]

the clock and alarm concept really helped understanding the algorithm clearly 👍🏻

[georgosfyssas]

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!

[prernagarg]

Nice explanation, it's clear my doubt Sir

[noobgameplay]

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?

[mengasrivani]

Thank you very much sir... In this pandamic situation these lecture help me a lot...

[mhamadslyman]

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

[dianacarolinavertizdelvall]

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?

[tgamerz]

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.