Question: The CPU and I/O times for 2 processes are shown below. Assume that P1 gets to the ready queue just before P2 and the scheduling

The CPU and I/O times for 2 processes are shown below. Assume that P1 gets to the ready queue just before P2 and the scheduling algorithm used by the OS is Round Robin with a time slice of 3 time units. Assume that the I/Os for the processes are different so that there is no I/O queue. Assume also that an interrupt from a completed IO for process "X" will place process "X" in the ready queue BEHIND the process that was just interrupted.

Using the first empty graph, describe how the CPU will be assigned to each process and for how long.

Use the seocnd empty graph to show ALL the states that P1 goes through and the amount of time it has remained in that state until it has halted.

The CPU and I/O times for 2 processes are shown below. Assume

Please go into detail with your answer!

2 3 CPU halt P1 6 I/O 5 2 halt CPU 2 3 I/O Busy CPU Idle CPU STATES P2

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!