Question: Question 2 [Points 5] Consider a system running 1 CPU-bound task (C1) and 1 I/O- bound tasks (I1). I/O bound task issues an I/O operation
Question 2 [Points 5] Consider a system running 1 CPU-bound task (C1) and 1 I/O- bound tasks (I1). I/O bound task issues an I/O operation (of 20 milliseconds duration) for every 2 milliseconds of CPU time. CPU-bound task issues an I/O operation (of 1 millisecond duration) for every 15 milliseconds of CPU time. A CPU-bound task requires 30 milliseconds of CPU to complete and an I/O-bound task requires 6 milliseconds of CPU time. Assume that there is only one I/O device (so multiple I/O requests may have to queue). Assume that CPU context switch time is negligible. Assume that the ready queue has C1, I1 jobs in that order with C1 at the front of the queue. There are no jobs in the system at time 0. Assume FCFS scheduling for both CPU and I/O. For any job, an execution cycle has CPU execution followed by I/O. Show through Gantt charts (as a table) how the I/O and CPU are allocated and compute the average turnaround times for the CPU-bound and I/O-bound tasks. (Note: Each CPU- bound job ends with an I/O operation which is unusual. But that is okay for this example.)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
