Summary of Scheduling Algorithms - Round Robin Scheduling

00:00:00 - 00:15:00

The round robin scheduling algorithm is used in time-sharing systems to preempt processes and switch between them. Each process is given a time quantum to execute, after which the next process in the queue is given the CPU. If a process does not finish in its allotted time, it is moved to the end of the queue and the next process is given the CPU. This process repeats until all processes have finished.

• 00:00:00 The round-robin scheduling algorithm is designed for time-sharing systems, and is similar to the first-come-first-serve (FCFS) scheduling algorithm but with the addition of preemption to switch between processes. The ready queue is treated as a circular queue, and the CPU scheduler goes around the ready queue allocating the CPU to each process for a time interval of up to time quantum.
• 00:05:00 Round robin scheduling is a method of allocating resources among a group of processes. Each process is given a certain amount of time to execute, after which the next process is given the CPU. If the process does not finish in the allotted time, the CPU is released and given to the next process in the queue.
• 00:10:00 This 1-paragraph summary explains the Round Robin Scheduling algorithm. When a process exceeds its allotted time quantum, it is taken from the head of the queue and put at the tail, where it continues in the straight way. The CPU scheduler will always pick the process at the head of the queue, and when this process is put from the head to the tail, it becomes the new head and the CPU scheduler will assign it the CPU and allotted time quantum. This process will be executing for the allotted time quantum, and for any processes waiting in queue, it will be keeping them waiting for the process to release the CPU.
• 00:15:00 This video discusses the use of round robin scheduling in work environments.