上机实践内容：

编写并调试一个模拟的进程调度程序，采用“最高优先数优先”调度算法对五个进程进行调度。

“最高优先数优先”调度算法的基本思想是把CPU分配给就绪队列中优先数最高的进程。

　　静态优先数是在创建进程时确定的，并在整个进程运行期间不再改变。

动态优先数是指进程的优先数在创建进程时可以给定一个初始值，并且可以按一定原则修改优先数。例如：在进程获得一次CPU后就将其优先数减少1。或者，进程等待的时间超过某一时限时增加其优先数的值，等等。

-Computer Practicals: write and debug a simulation of the process scheduler, the highest priority number of priority scheduling algorithm on the five process scheduling. " The highest priority number of priority scheduling algorithm' s basic idea is to allocate the CPU ready queue priority number highest process. Static priority number is determined when the process is created, and does not change during the run of the entire process. Dynamic priority number, priority number refers to the process of the creation process can be given an initial value, and priority number can be modified according to certain principles. For example: the first CPU in the process after its priority to reduce the number of 1. Alternatively, process waiting time exceeds a certain time limit to increase the value of its priority number, and so on.