文章目录
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.



轮转调度算法解析
本文介绍了轮转(Round Robin, RR)调度算法的基本原理及特点。RR算法主要用于时间共享系统中,通过抢占的方式实现进程间的公平调度。每个进程被分配一个固定的时间片(quantum),一般设置为10到100毫秒之间,确保所有进程都能获得公平的CPU执行时间。
1021

被折叠的 条评论
为什么被折叠?



