说明：  java进程调度，处理机调度算法的实现 1． 设定系统中有五个进程，每一个进程用一个进程控制块表示。 2． 输入每个进程的“优先数”和“要求运行时间”， 3． 为了调度方便，将五个进程按给定的优先数从大到小连成就绪队列。用一单元指出队列首进程，用指针指出队列的连接情况。 4． 处理机调度总是选队首进程运行。采用动态优先数算法，进程每运行一次优先数就减“1”，同时将运行时间减“1”。 5． 若要求运行时间为零，则将其状态置为“结束”,且退出队列。 6． 运行所设计程序，显示或打印逐次被选中进程的进程名以及进程控制块的动态变化过程。
(java process scheduling, processor scheduling algorithm. Set system of five processes, each process with a process control block, said. Two. " Priority number" input of each process and the requirements of running time, 3. For scheduling convenience, the five process given the number of priority beginning with the largest connected into the ready queue. With a unit pointed out that the head of the queue process, the pointer pointed out that the connection queue. 4. Processor scheduling is always the first process of the election team run. Using the dynamic priority algorithm, the process each time you run priority number minus " 1" , run time minus " 1" . 5 Require run-time is zero, it is state set to " end" , and exit the queue. 6. Run the design process, display or print the process of successive selected process name and process control block dynamic process.)