Question

Assume all processes arrived at time equals zero, using Round Robin CPU scheduling algorithm with time quantum = 3 do the following: Draw Gantt chart Calculate average waiting time. Which one is optimal and why? What kind of scheduling algorithm optimization criteria that can be seen in this example and how can we improve it? Q. Consider a system with 3 resource types X, Y and Z having 10 instances each. Given the following information, which process will finish last? Do you think the system is safe? Allocation Max resources X Y Z X Y Z P$_1$ 1 2 1 3 2 4 P$_2$ 2 0 1 2 1 2 P$_3$ 2 2 0 3 4 2 P$_4$ 1 3 0 1 5 2

          Assume all processes arrived at time equals zero, using Round Robin CPU scheduling algorithm
with time quantum = 3 do the following:
Draw Gantt chart
Calculate average waiting time.
Which one is optimal and why?
What kind of scheduling algorithm optimization criteria that can be seen in this example and how
can we improve it?
Q. Consider a system with 3 resource types X, Y and Z having 10 instances each. Given the
following information, which process will finish last? Do you think the system is safe?
Allocation
Max
resources
X Y Z
X Y Z
P$_1$
1 2 1
3 2 4
P$_2$
2 0 1
2 1 2
P$_3$
2 2 0
3 4 2
P$_4$
1 3 0
1 5 2

Assume all processes arrived at time equals zero, using Round Robin CPU scheduling algorithm
with time quantum = 3 do the following:
Draw Gantt chart
Calculate average waiting time.
Which one is optimal and why?
What kind of scheduling algorithm optimization criteria that can be seen in this example and how
can we improve it?
Q. Consider a system with 3 resource types X, Y and Z having 10 instances each. Given the
following information, which process will finish last? Do you think the system is safe?
Allocation
Max
resources
X Y Z
X Y Z
P1
1 2 1
3 2 4
P2
2 0 1
2 1 2
P3
2 2 0
3 4 2
P4
1 3 0
1 5 2

Added by Amy T.

Question

Please give Ace some feedback