操作系统概念(中文版)课后答案1.ppt

6-cont. 4. Suppose that the following processes arrive for execution at the times indicated. Each process will run the listed amount of time. In answering the questions, use nonpreemptive scheduling and base all decisions on the information you have at the time the decision must be made. a. What is the average turnaround time for these processes with the FCFS scheduling algorithm? ((8-0)+(12-0.4)+(13-1.0))/3 = 10.53 b. What is the average turnaround time for these processes with the SJF scheduling algorithm? ((8-0)+(13-0.4)+(9-1.0))/3 = 9.53 c. The SJF algorithm is supposed to improve performance, but notice that we chose to run process P1 at time 0 because we did not know that two shorter processes would arrive soon. Compute what the average turnaround time will be if the CPU is left idle for the first 1 unit and then SJF scheduling is used. Remember that processes P1 and P2 are waiting during this idle time, so their waiting time may increase. This algorithm could be known as future-knowledge scheduling. ((14-0)+(6-0.4)+(2-1.0))/3 = 6.87 6-cont. 5. Consider the following preemptive priority-scheduling algorithm based on dynamically changing priorities. Larger priority numbers imply higher priority. When a process is waiting for the CPU (in the ready queue but not running), its priority changes at a rate A; when it is running, its priority changes at a rate B. All processes are given a priority of 0 when they enter the ready queue. The parameters A and B can be set to give many different scheduling algorithms. a. What is the algorithm that results from BA0? b. What is the algorithm that results from AB0? FCFS LIFO 6-cont. 6. Many CPU scheduling algorithms are parameterized. For example, the RR algorithm requires a parameter to indicate the time slice. Multilevel feedback queues require parameters to define the number of queues, the scheduling algorithms for each queue, the criteria used to move processes between queues, and so on. These a