1-7章典型例题-v1解析.docVIP

(5 points)There exist two processes P1 and P2 in a multiprogramming batch system. P2 enters into the system 10ms later than P1, and their executing traces, i.e. alternating sequences of CPU bursts and I/O bursts, are as follows: P1: computing, 80ms → I/O operation, 100ms → computing, 40ms P2: computing, 130ms → I/O operation, 50ms → computing, 50ms It is assumed that time costs of CPU scheduling and process switch are omitted, what is the maximal throughput for completing these two processes, and why? Answers： 1. 最大吞吐量 = 2/(80+130+50+50) = 2/310= 1/155 个/ms (3 points) 2. 当P1、P2的CPU计算和I/O操作最大程度并行执行时，2个进程总的执行时间最短，系统吞吐量达到最大，如下图所示；（2 points） In a computer system, the users submit to the system their computational tasks as jobs, and all these jobs are then stored as the standby jobs on the disk. The job scheduler (also known as long-term scheduler) selects the standby jobs on the disk, creates new processes in memory for them, and then starts executing of these processes. Each job’s ID is the same as that of the process created for it, for example, Ji and Pi. When the number of concurrent processes in memory is lower than three, the job scheduler takes the FCFS algorithm to select a standby job on the disk to create a new process. Otherwise, the jobs should wait on the disk. For the processes in memory, the process scheduler (also known as short-term scheduler) takes the non-preemptive priority-based algorithm to select a process and allocates the CPU to it. It is assumed the system costs resulting from job and process scheduling are omitted. Consider the following set of Jobs J1, J2, J3 , J4 and J5. For 1≤ i ≤5, the arrival time of each Ji , the length of the CPU burst time of each process Pi, and the priority number for each Ji/Pi are given as below, and a smaller priority number implies a higher priority. Job Arrival Time Burst Time Priority Number (minute) J1 14:00 40 4 J2