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

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 42 (Page No. 177)

0 votes
243 views
Explain how time quantum value and context switching time affect each other, in a round-robin scheduling algorithm.
in Operating System 243 views

1 Answer

2 votes
There is an inverse relation between time quantum and context switching in a round robin scheduling as very high time quantum may lead to starvation , i.e. , other processes have to wait to more. If time quantum is small then there will be more context switching and more process will get time to be executed for lesser time period .
← Prev. Next →
← Prev. Qn. in Sub. Next Qn. in Sub. →

Related questions

1 vote
1 answer
1
191 views
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 43 (Page No. 177)
Measurements of a certain system have shown that the average process runs for a time $T$ before blocking on $I/O$. A process switch requires a time $S$, which is effectively wasted (overhead). For round-robin scheduling with quantum $Q$, give a formula ... $Q > T$ $S < Q < T $ $Q = S$ $Q\: \text{nearly}\: 0$
Measurements of a certain system have shown that the average process runs for a time $T$ before blocking on $I/O$. A process switch requires a time $S$, which is effectively wasted (overhead). For round-robin scheduling with quantum $Q$, give a formula for the CPU efficiency for each of the following: $Q = \infty$ $Q > T$ $S < Q < T $ $Q = S$ $Q\: \text{nearly}\: 0$
asked Oct 25, 2019 in Operating System Lakshman Patel RJIT 191 views
0 votes
0 answers
2
115 views
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 45 (Page No. 177 - 178)
Five batch jobs. $A$ through $E$, arrive at a computer center at almost the same time. They have estimated running times of $10, 6, 2, 4,$ and $8$ ... through $(d),$ assume that only one job at a time runs, until it finishes. All jobs are completely CPU bound.
Five batch jobs. $A$ through $E$, arrive at a computer center at almost the same time. They have estimated running times of $10, 6, 2, 4,$ and $8$ minutes. Their (externally determined) priorities are $3, 5, 2, 1,$ and $4,$ respectively, with $5$ being the highest ... the CPU. For $(b)$ through $(d),$ assume that only one job at a time runs, until it finishes. All jobs are completely CPU bound.
asked Oct 25, 2019 in Operating System Lakshman Patel RJIT 115 views
0 votes
1 answer
3
88 views
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 44 (Page No. 177)
Five jobs are waiting to be run. Their expected run times are $9, 6, 3, 5,$ and $X$. In what order should they be run to minimize average response time? $($Your answer will depend on $X.)$
Five jobs are waiting to be run. Their expected run times are $9, 6, 3, 5,$ and $X$. In what order should they be run to minimize average response time? $($Your answer will depend on $X.)$
asked Oct 25, 2019 in Operating System Lakshman Patel RJIT 88 views
0 votes
3 answers
4
298 views
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 40 (Page No. 177)
Round-robin schedulers normally maintain a list of all runnable processes, with each process occurring exactly once in the list. What would happen if a process occurred twice in the list? Can you think of any reason for allowing this?
Round-robin schedulers normally maintain a list of all runnable processes, with each process occurring exactly once in the list. What would happen if a process occurred twice in the list? Can you think of any reason for allowing this?
asked Oct 25, 2019 in Operating System Lakshman Patel RJIT 298 views
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...