操作系统第六部分学习课件.pptVIP

* * * * * * * * * * * * * * * * * * Operating System Examples Solaris scheduling Windows XP scheduling Linux scheduling Solaris 2 Scheduling Solaris Dispatch Table Windows XP Priorities Linux Scheduling Two algorithms: time-sharing and real-time Time-sharing Prioritized credit-based – process with most credits is scheduled next Credit subtracted when timer interrupt occurs When credit = 0, another process chosen When all processes have credit = 0, recrediting occurs Based on factors including priority and history Real-time Soft real-time Posix.1b compliant – two classes FCFS and RR Highest priority process always runs first The Relationship Between Priorities and Time-slice length List of Tasks Indexed According to Prorities Algorithm Evaluation Deterministic modeling – takes a particular predetermined workload and defines the performance of each algorithm for that workload Queueing models Implementation 假定有三个作业，它们到达后备队列的时间、估计运行时间和优先数如下图所示： ┌──┬────┬────┬───┐ │作业│到达时间│运行时间│优先级│ ├──┼────┼────┼───┤ │ 1 │ 8.00 │1.5 小时│ 2 │ ├──┼────┼────┼───┤ │ 2 │ 8.50 │2.0 小时│ 6 │ ├──┼────┼────┼───┤ │ 3 │ 9.20 │0.2 小时│ 7 │ └──┴────┴────┴───┘ 回答下列问题（要求给出过程） ①采用最短作业优先调度算法时,作业的平均等待时间是多少? ②采用最优先级调度算法时,作业的平均周转时间是多少？ 作业 通常有哪几种创建进程的方法？创建一个新进程要做哪些工作？ 有三个同时到达的作业J1，J2和J3，它们的执行时间分别是T1，T2和T3，且T1T2T3。系统按单道方式运行且采用短作业优先算法，则平均周转时间是　 (3*T1+2*T2+T3)/3。 End of Chapter 5 * * * * * * * * * * * * * * * * * * * * * Chapter 5: CPU Scheduling Basic Concepts Scheduling Criteria ：调度基准 Scheduling Algorithms：调度算法 Multiple-Processor Scheduling：多处理器调度 Real-Time Scheduling：实时调度 Thread Scheduling：线程调度 Operating Systems Examples Java Thread Scheduling Algorithm Evaluation：算法评估 Basic Concepts Maximum CPU utilization obtained with multiprogramming 使用多道程序来最大化CPU利用率， CPU–I/O Burst Cycle(CPU区间周期） – Process execution consists of a cycle of CPU execution and I/O wait 进程执行由CPU执行和I/O等待周期组成 CPU burst distribution Alternating Sequence of CPU And I/O BurstsCPU和I/O交替工作序列 CPU SchedulerCPU调度 Selects from a