Suppose two processes enter the ready queue with the following properties:

Process 1 has a total of 8 units of work to perform, but after every 2 units

of work, it must perform 1 unit of I/O (So the completion time of this process is 12

units. Assume that there is no work to be done following the last I/O operation.

Process 2 has a total of 20 units of work to perform. This process arrives just

behind P1.

Show the resulting schedule for the shortest-job-first (preemptive) and the roundrobin

algorithms. Assume a time slice of 4 units for RR. What is the completion

time of each process under each algorithm?

Process 1 has a total of 8 units of work to perform, but after every 2 units

of work, it must perform 1 unit of I/O (So the completion time of this process is 12

units. Assume that there is no work to be done following the last I/O operation.

Process 2 has a total of 20 units of work to perform. This process arrives just

behind P1.

Show the resulting schedule for the shortest-job-first (preemptive) and the roundrobin

algorithms. Assume a time slice of 4 units for RR. What is the completion

time of each process under each algorithm?

### Recently Asked Questions

- 1.Sales of a product have grown at a rate of S 0 (x) = 400x+ 200 x+1 per month. How many units were sold in the first two months? 2.Find the area between

- 3.Which of the following is correct? Banks cannot lend out money unless it has been previously deposited with them. Banks cannot lend money out unless it is

- Suppose a delivery company states that their packages arrive within two days or less on average . You want to find out whether the actual average delivery time