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

- 3 suppose you perform a multiple regression to predict crime rate in a state and includes as indicators of predictions the homeownership rate divorce rate and

- A solid, insulating sphere of radius R has a uniform charge density p. What is the magnitude of the electric field a distance 3R/4 from the center of the

- 2 suppose you perform a multiple regression to predict crime rate in a state and includes as indicators of predictions the homeownership rate divorce rate and