进程调度算法：优先数调度优先级最高的…

代码说明：

进程调度算法：采用最高优先数优先的调度算法，即把处理机分配给优先数最高的进程。 每个进程由一个进程控制块（PCB）表示。进程控制块可以包含如下信息：进程名、优先数、需要运行的时间、已占用的CPU时间、进程状态等等。 进程的优先数及所需要运行的时间可以事先人为地指定（也可由随机数产生）。 进程的运行时间以时间片为单位进行计算。 每个进程的状态可以是就绪W（Wait），运行R（Run），或完成F（Finish）三种状态之一。 -process Scheduling Algorithm : The highest priority of several priority scheduling algorithm, which is allocated to the processor the highest priority in the process. Every process from a process control block (PCB) said. Process control block may contain the following information : process, and priority number, the need to run time, has taken the CPU time, the process of the state and so on. Several priorities for the process of what needs to run and the time prior to artificially designated (also be random number generator). The process of running time to time-unit calculations. The state of each process can be completed W (Wait), running R (Run), or completion of F (Finish), one of three state.