《操作系统概念》第六版作业解答1.pptVIP

6-cont. 6.3 Consider the following set of processes, with the length of the CPU-burst time given in milliseconds: The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0. a. Draw four Gantt charts illustrating the execution of these processes using FCFS, SJF, a nonpreemptive priority (a smaller priority number implies a higher priority), and RR (quantum = 1) scheduling. b. What is the turnaround time of each process for each of the scheduling algorithms in part a? c. What is the waiting time of each process for each of the scheduling algorithms in part a? d. Which of the schedules in part a results in the minimal average waiting time (over all processes)? 6-cont. 6.3 a. b. c. d. SJF 6-cont. 6.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. 6.7 Consider the following preemptive priority-scheduling algorithm based on dynamically changing priorities. Larger priority numbers imply higher pr