第四讲CPU调度（partII）.pptVIP

Multilevel Queue Scheduling Multilevel Feedback Queue多级反馈队列 A process can move between the various queues; aging can be implemented this way Multilevel-feedback-queue scheduler defined by the following parameters: number of queues scheduling algorithms for each queue method used to determine when to upgrade a process method used to determine when to demote a process method used to determine which queue a process will enter when that process needs service Example of Multilevel Feedback Queue Three queues: Q0 – time quantum 8 milliseconds, FCFS Q1 – time quantum 16 milliseconds, FCFS Q2 – FCFS Scheduling A new job enters queue Q0 which is served FCFS. When it gains CPU, job receives 8 milliseconds. If it does not finish in 8 milliseconds, job is moved to queue Q1. At Q1 job is again served FCFS and receives 16 additional milliseconds. If it still does not complete, it is preempted and moved to queue Q2. 调度算法 FCFS SJF RR Priority－based 多级队列（及反馈）调度 优先级倒转问题及其解决方案 Priority inversion (优先级倒转 ) Priority inversion When the higher-priority process needs to read or modify kernel data that are currently being accessed by another, lower-priority process The high-priority process would be waiting for a lower-priority one to finish E.g.: Priority: P1PRT3PRT2 PRT3 preempt P1; PRT2 waits for P1; ?PRT2 waits for PRT3 （图） P1 PRT3 PRT2 抢占 抢占 Priority inversion (cont.) Solution Priority-inheritance (lending) 优先级继承 PRT2 lends its priory to P1, thus PRT3 could not preempt P1 Priority inheritance must be transitive E.g.: Priority: P1PRT3PRT2 另外一种方法：优先级置顶（天花板协议） 考虑所有可能访问资源的进程优先级 设置置顶优先级（即天花板） 只要有进程被分配到该资源，该进程的优先级就上升到置顶优先级 释放资源时，降回原来的优先级继续运行 回顾 调度的类型 调度的队列模型 调度的准则 调度的算法 作业： 从调度的层次上看，有哪几种调度？试画出同时具有这几种调度的队列模型图。 在选择调度的方式和算法时，面向用户的调度准则有哪些？面向系统的呢？ Ppt中的思考题。 第三次上机： 上机作业： 实现基于静态优先级的调度算法。 （附加，可不做）在上述算法之上，实现FCFS算法和SJF算法。 * 即：FCFS算法有利于CPU繁忙型作业，而不利于I/O繁忙型作业 第四讲 CPU调度（part II） 中国科学技术大学计算机系 陈香兰 xlanchen@ustc.edu.cn Fall 2013 内容提要 调度的类型 调度的队列模型 调度的准则 调度的算法 调度算法 FCFS SJF RR Priority－