menu
search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

Round robin scheduling algorithm

0 votes
2.8k views
What happens to average Turn Around Time if time quantum increased?
in Operating System 2.8k views
0
Increasing time quantam for one process may affect completion time of other processes as waiting time of other processes may increase.

We cannot conclude that increasing time quantam decreases turnaround time.
0
waiting time also increase

2 Answers

1 vote
 
Best answer

Turn around time (TAT) = Completion Time - Arrival Time

Round Robin = Process Burst Time / Time Quantum = Number of times a process is scheduled.

Which means, more the Time Quantum, lesser number of times the process would be scheduled

and less the Time Quantum, more number of times the process would be scheduled.

More the number of times the process is scheduled, more will be its Completion Time.

Keeping Arrival Time constant, more the Completion Time, more will be the Turn Around Time (TAT)

So, if a time Quantum is increased, 

  • Number of times a process is scheduled will increase
  • So, it Completion Time will increase
  • Thus its Turn Around Time would increase

** Please note: Keeping Arrival Time constant


selected by
1
final conclusion is wrong..
it should be:
more the Time Quantum, lesser number of times the process would be scheduled
and hence completion time will decrease resulting in decrement of TAT.
therefore avg. TAT will decrease on inc of time quantum
0
Yes, I agree the final conclusion is wrong. To quote "too_simple"

it should be:
more the Time Quantum, lesser number of times the process would be scheduled
and hence completion time will decrease resulting in decrement of TAT.
therefore avg. TAT will decrease on inc of time quantum
0
Well, your conclusion is also wrong.

On increasing the time quantum, TAT may increase or may decrease.
0
Well now I come to think of it,

The number of times the process wil scheduled will either remain same or it will decrease, it will NEVER increase. However, the turn around time may increase of decrease given the scheduling pattern.

Case where it might increase

Initially time quanta 2

P1 needs 7 time quanta to finish and P2 and P3 needs 10. All arrives at 0

P1(2) P2(2) P3(2), P1(2) P2(2) P3(2), P1(2) P2(2) P3(2), P1(1), P2(2), P3(2), P2(2) P3(2)

TAT for P1= 19, P2 = 25, P3 = 27

Avg TAT = 23.6667

Increase the time quanta to 3

P1(3) P2(3) P3(3), P1(3) P2(3) P3(3), P1(1) P2(3) P3(3), P2(1), P3(1)

TAT for P1: 19, P2 = 26, P3 = 27

Avg TAT = 24
0
Exactly !
1 vote
Rewriting my comment as answer:

If we increase the time quantum alloted to each process, the number of times the process will be scheduled will either remain same or it will decrease, it will NEVER increase. However, the turn around time may increase of decrease given the scheduling pattern.

Its easy to see where this will decrease. Case where it will increase:
===============================
Initially time quanta 2

P1 needs 7 time quanta to finish and P2 and P3 needs 10. All arrives at 0

P1(2) P2(2) P3(2), P1(2) P2(2) P3(2), P1(2) P2(2) P3(2), P1(1), P2(2), P3(2), P2(2) P3(2)

TAT for P1= 19, P2 = 25, P3 = 27

Avg TAT = 23.6667
--------------------------------------------------
Increase the time quanta to 3

P1(3) P2(3) P3(3), P1(3) P2(3) P3(3), P1(1) P2(3) P3(3), P2(1), P3(1)

TAT for P1: 19, P2 = 26, P3 = 27

Avg TAT = 24

===================
← Prev. Next →
← Prev. Qn. in Sub. Next Qn. in Sub. →

Related questions

3 votes
2 answers
1
1k views
Round Robin Scheduling
Consider a System using Round Robin scheduling with 10 Processes all arriving at the time 0. Each Process is associated with 20 identical Request. Each Process request consumes 20 ms of CPU time after which it spends 10 ms of time on I/O,thereafter ... ii. Response time of the 1st Request of the last Process. iii. Response time of the subsequent request of any process.
Consider a System using Round Robin scheduling with 10 Processes all arriving at the time 0. Each Process is associated with 20 identical Request. Each Process request consumes 20 ms of CPU time after which it spends 10 ms of time on I/O,thereafter intiates subsequent ... Process. ii. Response time of the 1st Request of the last Process. iii. Response time of the subsequent request of any process.
asked Aug 22, 2018 in Operating System Karan Dodwani 1 1k views
5 votes
3 answers
2
1.6k views
OS:- Round Robin scheduling
If we have only one process in ready queue with burst time "m", then how many context switching will happen using round robing scheduling with time quantum q ,where q<m.Assume that dispatching the process first time is not counted as a context switch.
If we have only one process in ready queue with burst time "m", then how many context switching will happen using round robing scheduling with time quantum q ,where q<m.Assume that dispatching the process first time is not counted as a context switch.
asked Aug 26, 2017 in Operating System rahul sharma 5 1.6k views
6 votes
1 answer
3
4.1k views
CPU efficiency in round robin algorithm
Measurements of a certain system have shown that a process runs, on the average, for time T before blocking for Input/Output. Process switch requires time S which is overhead. For round robin scheduling with quantum Q, give a formula for the ... Can somebody please explain option c and hence option D with example ,Thanks and sorry if it is naive question :)
Measurements of a certain system have shown that a process runs, on the average, for time T before blocking for Input/Output. Process switch requires time S which is overhead. For round robin scheduling with quantum Q, give a formula for the cpu efficiency in each of the ... goes to 0 Can somebody please explain option c and hence option D with example ,Thanks and sorry if it is naive question :)
asked Nov 15, 2017 in Operating System sunil sarode 4.1k views
1 vote
1 answer
4
259 views
IES 2018 - Round robin scheduling
Three processors with their respective process IDs given by P1, P2 and P3, having estimated completion time of 8 ms, 4 ms and 2 ms, respectively, enter a ready queue together in the order P1, P2 and P3. What is the average turn time in the Round Robin Scheduling Algorithm with time 2 ms? (a) 10 ms (b) 15 ms (c) 20 ms (d) 25 ms
Three processors with their respective process IDs given by P1, P2 and P3, having estimated completion time of 8 ms, 4 ms and 2 ms, respectively, enter a ready queue together in the order P1, P2 and P3. What is the average turn time in the Round Robin Scheduling Algorithm with time 2 ms? (a) 10 ms (b) 15 ms (c) 20 ms (d) 25 ms
asked Jan 9, 2018 in Operating System sh!va 259 views
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...