按优先级进行调度的算法，1. 用一个指针指向就绪队列的第一个进程，用另一个指针指向正在运行的进程。每个进程由一个PCB来标识。

2. 调度时，总是选择优先级最高的执行，并采用动态调度：每运行一次优先级减1，估计运行时间减1。

3. 重复调度直到全部完成。-By priority scheduling algorithms, with a pointer to the first process of the ready queue, and another pointer to point to a running process. Each process is identified by a PCB. Scheduling, always choose the highest priority execution and dynamic scheduling: Each time you run priority minus 1, the estimated running time minus 1. 3. Scheduling repeat until completed.