Assume two processes enter ready queue with following properties:
Process 1 has total of 8 units of work to perform, but after every 2 units of work, it should perform 1 unit of I/O (So completion time of this process is 12 units. Suppose that there is no work to be done following last I/O operation.
Process 2 has total of 20 units of work to perform. This process arrives just behind P1. Illustrate the resulting schedule for shortest-job-first (preemptive) and roundrobin algorithms. Suppose time slice of 4 units for RR. Determine the completion time of each process under each algorithm?