Consider the following set of processes, with length of the Burst Time given in milliseconds:

(5 points)

Process Arrival Time Burst Time Priority

P1 0.0 7 2

P2 2.0 4 1

P3 4.0 1 3

P4 5.0 4 2

1) Draw Gantt charts with ready queues if applicable, that using FCFS, SJF, Priority (a smaller priority number implies a higher priority), and RR (quantum = 1), with non-preemptive for all the algorithms applicable.

2) Repeat 1) with preemptive for the applicable algorithms only.

3) What is the Turnaround time of each process for each of the scheduling algorithms in 1) and RR in 2)?

FCFS SJF Priority RR

P1

P2

P3

P4

4) What is the Waiting time of each process for each of the scheduling algorithms in 1) and RR in 2).

FCFS SJF Priority RR

P1

P2

P3

P4

5) Which of the schedules in 1) and RR in 2) results in the minimal average waiting time over all processes? Show your judgments and calculations.

FCFS SJF Priority RR