Introduction - If you have any usage issues, please Google them yourself
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