1.　　优先数调度算法：

进程在就绪队列中按优先数的大小从大到小排列，调度算法总是选取队列中优先数高的进程投入运行，采用动态地改变优先数的方法，进程每运行一次优先权相应地减2，从而避免了一个作业长期占用处理机，当调度时机出现时，调度算法适时再调度，首先判断此进程是否运行完，未运行完再判断此进程的优先权是否大于等于队列中首进程的优先数，。若成立，就继续执行，这样重复做下去，直到就绪队列为空。

-1. The priority number of scheduling algorithms: the process in the ready queue in priority order of the number of smallest size, scheduling algorithm always select a few high-priority queue of the process put into operation, the use of dynamically changing the priority number of methods, each running process a priority corresponding to minus 2, thus avoiding a long-term occupation of processor operation, when scheduling the opportunity arise, the scheduling algorithm re-scheduling a timely manner, the first run to determine whether this process finished, is not running again after this process to determine whether the priority equivalent to queue in the first process priority number. If established, it continued to implement, so make repeat until ready queue is empty.