Operate System: Round Robin Scheduling

Background

Round Robin(RR) scheduling algorithm is mainly designed for time-sharing systems. In Round Robin(RR) scheduling, preemption is added which enables the system to switch between processes.
Features

• one of the oldest, easiest, and fairest algorithm, also a starvation-free algorithm: every process get a fair share of CPU time
• A fixed time is allotted to each process, called a quantum, for execution.
• the length of time quantum is generally from 10 to 100 milliseconds in length.

Process

lets set the quantum time to 5.