Скачать или смотреть (Part-2.15) Round Robin Algorithm | OS বাংলা টিউটোরিয়াল

Welcome to our deep dive into the Round Robin Algorithm! In this video, we'll explore one of the most widely used scheduling algorithms in computer science and operating systems. Whether you're a student, a software developer, or just curious about how multitasking systems efficiently manage tasks, this video is for you!

🔍 What You'll Learn:

What the Round Robin Algorithm is
How the algorithm works in task scheduling
Advantages and disadvantages of using Round Robin
Real-world applications and examples

Don't forget to like, subscribe, and hit the bell icon to stay updated with more educational content!

#RoundRobin #SchedulingAlgorithm #ComputerScience

Follow Me On Social Media -
Facebook -   / asad.nomanee  

Software Engineering Full Course Link :   • Software Engineering Bangla Tutorial  

Theory Of Computation Full Course Link :    • Automata Theory Bangla Tutorial (কমপ্লিট ক...  

Operating System Full Course Link:
   • Operating System (OS) Bangla Tutorial (কমপ...  

Computer Networks | Data Communication | Communication Engineering Full Course Link:
   • Плейлист  

Database Management System Full Course Link:
   • Плейлист  

---------------------------------------------
#Chapter2
#RoundRobinSchedulingAlgorithm

Round Robin scheduling algorithm is one of the most popular scheduling algorithm which can actually be implemented in most of the operating systems. This is the preemptive version of first come first serve scheduling. The Algorithm focuses on Time Sharing. In this algorithm, every process gets executed in a cyclic way. A certain time slice is defined in the system which is called time quantum. Each process present in the ready queue is assigned the CPU for that time quantum, if the execution of the process is completed during that time then the process will terminate else the process will go back to the ready queue and waits for the next turn to complete the execution.

#RRScheduling Example
In the following example, there are six processes named as P1, P2, P3, P4, P5 and P6. Their arrival time and burst time are given below in the table. The time quantum of the system is 4 units.
Process ID Arrival Time Burst Time
1 0 5
2 1 6
3 2 3
4 3 1
5 4 5
6 6 4
According to the algorithm, we have to maintain the ready queue and the Gantt chart. The structure of both the data structures will be changed after every scheduling.
Process ID Arrival Time Burst Time Completion Time Turn Around Time Waiting Time
1 0 5 17 17 12
2 1 6 23 22 16
3 2 3 11 9 6
4 3 1 12 9 8
5 4 5 24 20 15
6 6 4 21 15 11
Avg Waiting Time = (12+16+6+8+15+11)/6 = 76/6 units
Round robin scheduling
• Criteria of round robin is time quantum.
• Mode of round robin scheduling is pre-emptive.
Process No. Arrival time Burst time Completion time Turnaround time Waiting time Response time
P1 0 5
P2 1 4
P3 2 2
P4 4 1
Given time quantum = 2 unit of time
Before solving this question let’s see some points, which will help to solve this question.
• In round robin context switching is done.
• Context switching means to save the context of a running process. Context means PCB (process complete block), and sending back the process to ready queue and start executing next process, we save the context because we do not want to execute it from beginning rather we want to start executing that process from where we left.
• Completion time: The time at which process completes its execution.
• Turnaround time = Completion time – arrival time
• Waiting time = turnaround time – burst time
• Response time = CPU first time allocated – Arrival time
So, the final table obtained will be.
Process No. Arrival time Burst time Completion time Turnaround time Waiting time Response time
P1 0 5 12 12 7 0
P2 1 4 11 10 6 1
P3 2 2 6 4 2 2
P4 4 1 9 5 4 4





#OperatingSystem #OS #asadnomanee #banglalecture #CSE
#Lecturelia #MBSTU #MBSTU_CSE
#lecturelia #banglatutorial #bangla