说明：  编写并调试一个模拟的进程调度程序，采用“轮转法”调度算法对五个进程进行调度。 　　轮转法可以是简单轮转法、可变时间片轮转法，或多队列轮转法。 　　简单轮转法的基本思想是：所有就绪进程按 FCFS排成一个队列，总是把处理机分配给队首的进程，各进程占用CPU的时间片相同。如果运行进程用完它的时间片后还为完成，就把它送回到就绪队列的末尾，把处理机重新分配给队首的进程。直至所有的进程运行完毕。
(prepared a simulation and debugging process scheduling procedures, "reincarnated" Scheduling Algorithm of five scheduling process. Web law may be a simple Web, variable-time Web tablets, or rotate cohort method. Simply rotate the basic idea is : all ready process by FCFS queue formed a queue, processors are always allocated to the first team in the process, the process of CPU time slice of the same. If you are running a process spent its time for films completed, so I sent it back to the ready queue at the end. put processor re-allocated to the first team in the process. Process until all is finished.)