Round Robin scheduling algorithm with IO burst example in operating system

Process Scheduling Playlist: • Process scheduling alg...
In this video, we discuss round robin scheduling algorithm
Turnaround time, waiting time and response time formula: • CPU Scheduling Criteri...
process scheduling in operating system
fcfs scheduling algorithm in os
fcfs scheduling algorithm in operating system
fcfs scheduling
sjf scheduling algorithm in os
sjf scheduling algorithm in operating system
sjf scheduling
sjtf scheduling algorithm in os
sjtf scheduling algorithm in operating system
sjtf scheduling
priority scheduling algorithm in os
priority scheduling algorithm in operating system
priority scheduling with io burst
round robin scheduling algorithm in os
round robin scheduling algorithm in operating system
round robin scheduling with io burst

[@practicalcsjourney]

Operating system tutorial series - ruclips.net/video/0UvZ2BPIPX0/видео.html
Computer networking tutorial series - ruclips.net/video/krC08BwZctc/видео.html
Python tutorial series - ruclips.net/video/mHtjvDEdlas/видео.html

[@ReptilianBeats]

thank you very much sir. helped me with my homework.

[@raunakgupta1475]

Thanks a lot bhaiya , really very nice.even i didn't find it with io burst time in many popular videos of utube.

[@honeysharma8036]

can you please answer this
Consider three process, all arriving at time zero, with total execution time of 10, 20 and
30 units respectively. Each process spends the first 30% of execution time doing I/O, the next
40% of time doing computation, and the last 30% of time doing I/O again. The operating
system uses a round robin scheduling algorithm with time quantum 2 and schedules a new
process either when the running process gets blocked on I/O or when the running process
finishes its compute burst. Assume that all I/O operations can be overlapped as much as
possible. For what percentage of does the CPU remain idle?

[@practicalcsjourney]

Will solve and upload the solution for it.

[@varunsaproo4120]

@3:53, you finished P1 CPU Burst cycle. My questions is shouldn't P1 first go to Ready Queue, and when it gets its turn again, CPU sends back the P1 process to I/O queue because of its I/O burst cycle?

[@frankissac7540]

i realize I'm pretty off topic but do anybody know of a good place to watch new movies online?

[@uriahhunter1117]

@Frank Issac i dunno I use flixportal. just search on google for it:P -uriah

[@frankissac7540]

@Uriah Hunter thank you, I went there and it seems like they got a lot of movies there =) Appreciate it!!

[@uriahhunter1117]

@Frank Issac you are welcome xD

[@tamzidalam8766]

Is there any code for this?

[@gamersanditparadise]

Hey, you made this video using notability?

[@practicalcsjourney]

Yes

[@dekyls9113]

tu pues, c'est 17, tu puesseau

[@baqir1044]

Wrong p3 comes at 4

[@practicalcsjourney]

I have added p3 into the ready queue after p2 completes its time quantum at 6. P3 arrives at time 4 but still will be added into ready queue after p1 & p2 .