操作系统5种调度算法.ppt

Use an execution sequence diagrams describe RR (time = 1) algorithm to perform these operations, and calculate the turnaround time, average turnaround time of each job, weighted weighted and turnaround time, average turnaround time? The work Arrival time running time complete time The turnaround time(C-A) Weighted turnaround time(T/R) 1 0 10 19 19 1.9 2 1 1 2 1 1.0 3 2 2 8 6 3.0 4 3 1 5 2 2.0 5 4 5 16 12 2.4 The average turnaround time: 8.0 The weighted average turnaround time : 2.06 Advantages: For long, if wait long enough, priority is high also, also can get the CPU. To solve the short assignment priority algorithm, long assignment operation is not guaranteed. Is introduced into the algorithm. * Surface strongest team The time to display the results The next time The report PPT about the situation 一、List of team members 二、Task allocation Liu Fenghong in charge of report the PPT. Xiao Yujiang in charge of the FCFS algorithms. Xia Zhaoke in charge of the SRT algorithms. Zhang Jun in charge of the RR algorithms. Luo Zhenhua in charge of the High response ratio priority scheduling algorithm. Tai Zaicheng in charge of the SPN algorithms. 三、The team member introduction algorithm. Summary in operating system The First of all, we need to know the following questions: 1、What is a scheduling algorithm？ Operating system management of the limited resources of the system, when there are multiple processes (or multiple processes request) to use these resources, because of the limited resources, we must choose the process according to certain principles (request) to occupy resources. This is the scheduling. 2、What is the principle of scheduling algorithm？ In the system perspective fairness: each process (regardless of priority) has the opportunit