进程状态有5种： e -执行态 r -高就绪态 t -低就绪态 w -等待态 c -完成态。初始每个进程均为高就绪状态，如果时间片到则转为低就绪状态。

系统分时执行各进程，规定三个进程的执行概率均为33 。通过产生随机数x来模拟时间片。若各进程的执行时间片到限，产生“时间片中断”而转入低就绪状态。

进程调度算法采用剥夺式调度算法。每次总是选择优先数最小（优先级别最高）的就绪进程投入执行。//先从 r 状态进程中选择，再从 t 状态进程中选择。

进程0完成5次计算：s1++ s2++

进程1完成5次计算：s2++ s1++

进程2完成5次计算：s2++

-Process state has five kinds:　e -implementation of the state　r -high readiness state　t -low-ready state　w -wait state　c -complete

State. The initial state of each process are the high ready, if the time slice to be transformed into a low state of readiness.

System time-sharing implementation of the process, the implementation of the provisions of the three processes are 33　probability. By generating random numbers to simulate the time x

Film. If the process of implementation of the time slice to the limit, have a "time slice interrupt," and into the low state of readiness.

Process scheduling algorithm uses the deprivation of scheduling algorithm. Always choose the minimum number for each priority (highest priority) is ready

Into the implementation process.// Start with　r　state of the process of selection, from　t　state of the process of selection.

The completion of the process 0 5 calculated: s1++　s2++　

Process of a complete calculation 5: s2++　s1++　

2 to com