进程调度算法：采用最高优先数优先的调度算法（即把处理机分配给优先数最高的进程）和先来先服务算法。 每个进程有一个进程控制块（ PCB）表示。进程控制块可以包含如下信息：进程名、优先数、到达时间、需要运行时间、已用CPU时间、进程状态等等。 进程的优先数及需要的运行时间可以事先人为地指定（也可以由随机数产生）。进程的到达时间为进程输入的时间。进程的运行时间以时间片为单位进行计算。每个进程的状态可以是就绪 W（Wait）、运行R（Run）、或完成F（Finish）三种状态之一。就绪进程获得 CPU后都只能运行一个时间片。用已占用CPU时间加1来表示。 每进行一次调度程序都打印一次运行进程、就绪队列、以及各个进程的 PCB，以便进行检查。(Process scheduling algorithm: the highest priority number of priority scheduling algorithm (that is, the processor is assigned to the highest priority process) and first come first service algorithm. Each process has a process control block (PCB) representation. Process control blocks can contain the following information: process name, priority number, arrival time, run time, CPU time, process status, and so on. The priority number of the process and the required run time can be specified artificially (or by random numbers). The process's arrival time is the process's input time. The running time of a process is calculated as a time slice. The state of each process can be one of the three states of ready W (Wait), running R (Run), or completion of F (Finish). Once the ready process gets CPU, it can only run one time slice. Represented by taking CPU time plus 1. Each time the scheduler prints a run, a ready queue, and the PCB of each process for inspection.)