Given the following processes that arrived in the order shown,

	CPU Burst Time	IO Burst Time
P1	3	2
P2	4	3
P3	8	4

Show the activity in the processor and the I/O area using the FCFS, SJF, and Round Robin (with time slice = 2) algorithms. Use the diagram as shown in Example 1 in Section 6.6 at page 250 of the textbook. Assuming each process requires a CPU burst followed by an I/O burst followed by a final CPU burst (as in Example 1 in Section 6.6): Give the diagram for FCFS, SJF, and Round Robin

Solution:

FCFS -

SJF -

Round Robin (assumed times lice = 2) -