[计算机软件及应用]Ch02 Processes and Threads -1.pptVIP

CPU调度程序 调度程序 衡量调度的标准 先来先服务调度 先来先服务调度（续） 最短作业优先调度 优先级调度 时间片轮转 多级队列 多级反馈队列调度 多级反馈队列实例 * Scheduling in Interactive Systems (2) Priority scheduling Each process is assigned a priority, and the runnable process with the highest priority is allowed to run. Priority can be assigned to process statically or dynamically. * Scheduling in Interactive Systems (3) A scheduling algorithm with four priority classes * Scheduling in Interactive Systems (4) Shortest process next Shortest job first always produces the minimum average response time. The problem is figuring out which of the currently runnable processes is the shortest one. One approach is to make estimates based on past behavior and run the process with the shortest estimated running time. With , we get succesive estimate of * Scheduling in Interactive Systems (5) Multiple queues Guaranteed scheduling Lottery scheduling Give processes lottery tickets for various system resources, such as CPU time. Whenever a scheduling decision has to be made, a lottery ticket is chosen at random, and the process holding that ticket gets the resource. Fair-share scheduling Take into account who owns a process before scheduling it. * Scheduling in Real-Time Systems Given m periodic events 周期事件 event i occurs within period Pi and requires Ci seconds of CPU time to handle each event Then the load can only be handled if A real time system that meets this criteria is said to be schedulable (可调度的). e.g. Three periodic events, with periods of 100, 200 and 500 msec, respectively. If these events require 50, 30, and 100 msec of CPU time per event. The system is schedulable because 0.5+0.15+0.21. * Thread Scheduling Possible scheduling of user-level threads 50-msec process quantum threads run 5 msec/CPU burst * Thread Scheduling (2) Possible scheduling of kernel-level threads 50-msec process quantum threads run 5 msec/CPU burst Operating Systems Lesson 3 (refine and exercise) * CPU Scheduler Selects from among th