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
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
- develop a graphic rating scale for a sales associate and a fast food manager
- HeLa cells were treated with a new experimental drug (thought to inhibit BCL-2) to rule out any potential cytotoxic effects. Cells were exposed to the drug for
- PN is a procedure used to remove kidney stones by a small puncture incision in the skin. The treatment was defined as successful if stones were eliminated or