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
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
- What are stocks and bonds? Describe how you could estimate their values. If you are investing in the stock market, which would you invest in and why?
- Description of an intercultural event participated in and must address the impact of the explored and observed cultural variables on intercultural
- hat internal and external factors influence authentic data collection?