Assume that you have four different processes with the following attributes:

Process Arrival time. CPU Burst. I/O Burst Total CPU time

A. 0 4 4 9

B 3 2 3 7

C 6 5 1 11

D 12 1 1 5

As we did in class, perform a scheduling simulation using these four processes according to the following algorithms:

1) First Come First Serve

2) Round Robin with time slice = 1

3) Round Robin with time slice = 3

4) Shortest Job (CPU Burst Time) First (no preemption, as we did in class)

5) Extra credit - Shortest Job (CPU Burst Time) First (with preemption, as we mentioned at the end of class)

For each simulation, if multiple processes would be placed into the ready queue at the same time, give highest priority to a newly arriving process, next a process completing its Blocked wait time (if two are unblocked at the same time, prefer the one that waited the longest), and lastly a process that has just finished its time slice.

Turn in the time line for each simulation (you may draw these by hand and scan them, or do them electronically). Also compute the turnaround time, queue waiting time, and response time for each process, as well as the percentage idle time for the CPU overall and the number of context switches. Indicate which scheduling scheme you think performed the best.