Question

(30 points) Assume you have three processes with the following attributes running on a single CPU (uniprocessor system): Process 1/0 Burst Total CPU Time Arrival Time CPU Burst | 05 22 12 B 7 10 C D Create three scheduling simulations for these processes using the following algorithms: a. First Come First Served (FCFS) b. Round Robin, Time Slice = 2 c. Shortest Job (CPU Burst Time) First with NO Preemption Use the simulation format we covered in class to create timelines for each simulation. For parts A and B, if multiple processes would be placed into the ready queue at the same time, give the highest priority to a newly arriving process; the next highest priority to a process completing its blocked wait time (if two are unblocked at the same time, prefer the one that waited the longest); and finally, the lowest priority to a process that has just finished its time slice. For Part C, always prefer the process with the shortest CPU burst time. You do NOT have to calculate turnaround times, wait times, or response times for these simulations, all you need to submit is the timelines.

Answer 1

1. FCFS

A

B

C

0 5 7 10

2. Round Robin Time Slice = 2

A

B

C

A

C

A

0 2 4 6 8 9 10

3. SJF Non preemtive

A

B

C

0 5 7 10

Drcas 2) Round Robin (Time sluce =2) 0 2 4 6 8 9 10 3 SJ f Non-preemitine 0 5 7 10