Question

Consider the following set of processes, with the length of the CPU burst time given in milliseconds:

Process            Burst Time      Priority

P1                    7                      5

P2                    2                      4

P3                    11                    3

P4                    9                      1

P5                    5                      3

The processes are assumed to have arrived in the order P1,P2, P3, P4, P5,

all at time 0.

Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, nonpreemptive priority (a smaller priority number implies a higher priority), and RR (quantum = 2).

* Please provide a chart for all questions *

PART A

a. FCFS: Enter the order of the processes

b. Enter times for above chart starting with 0

c. SJF: Enter the order of the processes

d. Enter the times for the above chart starting with 0

e. Priority: Enter the order of the processes

f. Enter the times for the above chart starting with 0

g. Round Robin: Enter the order of the processes

h. Enter the times for the above chart starting with 0

* Please provide a chart for all questions *

PART B

1) What is the turnaround time of each process for each of the scheduling algorithms in part a?

2) What is the waiting time of each process for each of these scheduling algorithms?

3) Which of the algorithms results in the minimum average waiting time (over all processes)?

Answer 1

PartB 3:

SJF algorithm results in minimum average waiting time=9.2