操作系统中的处理机调度调度
Round Robin scheduling algorithm is a type of preemptive type of scheduling used by the operating system for scheduling the processes. In the Round Robin scheduling algorithm, a time quantum is decided which remains constant throughout the execution of all processes. Each process executes only for this much time. If within this time, the process completes its execution, then it is terminated. Else, it waits for its turn for again getting the processor for the same time quantum, and this process continues. Let us understand it further with the help of an example.
循环调度算法是一种抢占式调度类型,操作系统使用它来调度进程。 在循环调度算法中 ,确定一个时间量,该时间量在所有过程的执行过程中保持不变。 每个进程只执行这么长时间。 如果在这段时间内该过程完成了执行,则终止。 否则,它等待轮到它再次获得相同时间段的处理器,并且此过程继续进行。 让我们借助示例进一步了解它。
Suppose we have 4 processes: P1, P2, P3, and P4, with the following properties: