Register

GO Classes DPP | OS |ROUND ROBIN

254 views
2 2 votes

Consider three processes with the following CPU burst times: $P_1=2, P_2=7$, and $P_3=10$. All processes arrive at time $t=0$. The system uses Round Robin scheduling with a time quantum $Q=4$.

Calculate the Average Turnaround Time (TAT) for these processes.

2 Answers

1 1 vote

$0-2: P_1$ (Finishes). $T A T=2$.

$2-6: P_2$ $($Remains $3).$

$6-10: P_3$ $($Remains $6).$

$10-13: P_2$ (Finishes). $T A T=13$.

$13-17$ : $P_3$ $($Remains $2).$

$17-19: P_3$ (Finishes). $T A T=19$.

Avg TAT $=(2+13+19) / 3=34 / 3=11.33$.

1 1 vote

$0-2: P_1$ (Finishes). $T A T=2$.

$2-6: P_2$ $($Remains $3).$

$6-10: P_3$ $($Remains $6).$

$10-13: P_2$ $($Finishes). $T A T=13$.

$13-17$ : $P_3$ $($Remains $2).$

$17-19: P_3$ (Finishes). $T A T=19$.

Avg TAT $=(2+13+19) / 3=34 / 3=11.33$.

Voting & Accepting an answer helps improve the community
Answer:
← Previous · GO Classes DPP | OS ...Next → · GO Classes DPP | OS ...
← Previous in category · GO Classes DPP | OS ...Next in category → · GO Classes DPP | OS ...
Position:
Show:

Related questions

4 4 votes
2 2 answers
285
285 views
GO Classes asked Feb 16
285 views
GO Classes DPP | OS | PAGING
A computer system uses $\mathbf{32}$-bit virtual addresses. The system implements a two-level hierarchical paging scheme. The page size of the Outer Page Table is exactly...
3 3 votes
2 2 answers
330
330 views
GO Classes asked Feb 16
330 views
GO Classes DPP | OS | RESOURCE ALLOCATION
A system has $4$ copies of resource $R$. There are $n$ processes, and each process requires at most $2$ copies of resource $R$ to complete its execution.Which of the foll...
4 4 votes
1 1 answer
247
247 views
GO Classes asked Feb 16
247 views
GO Classes DPP | OS | FILE SYSTEM
An inode-based file system uses $4$ KB blocks and $4$-byte disk addresses. The inode contains $12$ direct block pointers, $1$ single indirect pointer, and $1$ double indi...
2 2 votes
1 1 answer
241
241 views
GO Classes asked Feb 16
241 views
GO Classes DPP | OS | SYNCHRONIZATION
Consider three concurrent processes $P_1, P_2$, and $P_3$ sharing a single counting semaphore $\verb|S|$ initialized to $\mathbf{2}$. Each process executes the following ...