多级反馈队列调度算法Multilevel Feedback SchedulingPreemptive schedulingwithdynamicpriorities动态优先级的抢占式调度Severalreadytoexecutequeueswithdecreasingpriorities:按优先级构成多个就绪队列P(RQO) >P(RQ1) > ... >P(RQn)NewprocessareplacedinRQo新进程放入优先级为0（高优先级）的队列Whentheyreachthetimequantum,theyareplaced inRQ1.Iftheyreachitagain,theyareplaceinRQ2...untiltheyreachRQn时间片用完将被放入下一级就绪队列直到第n级队列I/O-boundprocesseswill stayinhigherpriorityqueues.CPUboundjobs will driftdownward.I/O进程将保持在较高优先级队列中，而计算型将降级DispatcherchoosesaprocessforexecutioninRQionlyifRQi-1toRQOareempty仅当0至i-1级队列中无进程时才调度级队列的进程
多级反馈队列调度算法 Multilevel Feedback Scheduling Preemptive scheduling with dynamic priorities 动态优先级的抢占式调度 Several ready to execute queues with decreasing priorities: 按优 先级构成多个就绪队列 P(RQ0) > P(RQ1) > . > P(RQn) New process are placed in RQ0 新进程放入优先级为0（高优先级）的队列 When they reach the time quantum, they are placed in RQ1. If they reach it again, they are place in RQ2. until they reach RQn 时间片用完将被放入下一级就绪队列直到第n级队列 I/O-bound processes will stay in higher priority queues. CPUbound jobs will drift downward. I/O进程将保持在较高优先级队列中，而计算型将降级 Dispatcher chooses a process for execution in RQi only if RQi-1 to RQ0 are empty 仅当0至i-1级队列中无进程时才调度i级队列的进程
各级队列具有大小不同的时间片，0级时间片最小，各级逐渐递增新进程进入较高优先级的空就绪队列时重新调度，抢占处理WindowsNT中就采用该算法RQOReleaseAdmitRQ1ReleaseRQnRelease
各级队列具有大小不同的时间片，0级时间片最小，各 级逐渐递增 新进程进入较高优先级的空就绪队列时重新调度，抢占 处理 Windows NT中就采用该算法