Register

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 46 (Page No. 178)

• edited by
713 views

1 Answer

1 votes
1 votes

Answer:

The first time it receives 1 quantum.

In the following execution, it receives $2, 4, 8, \text {and}\; 15$. Hence, it should be swapped $5$ times.

$\bf2^\textbf{ nd}$ quanta of time: $1 + 2 + 4 + 8 + 15 = 30$

• edited by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
admin asked Oct 25, 2019
580 views
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 53 (Page No. 178)
Consider a system in which it is desired to separate policy and mechanism for the scheduling of kernel threads. Propose a means of achieving this goal.
Consider a system in which it is desired to separate policy and mechanism for the scheduling of kernel threads. Propose a means of achieving this goal.
User Avatar
0 votes
0 votes
1 answer
2
admin asked Oct 25, 2019
1,309 views
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 52 (Page No. 178)
A real-time system needs to handle two voice calls that each run every $6$ msec and consume $1$ msec of CPU time per burst, plus one video at $25$ frames/sec, with each frame requiring $20$ msec of CPU time. Is this system schedulable?
A real-time system needs to handle two voice calls that each run every $6$ msec and consume $1$ msec of CPU time per burst, plus one video at $25$ frames/sec, with each f...
User Avatar
1 votes
1 votes
1 answer
4
admin asked Oct 25, 2019
2,139 views
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 49 (Page No. 178)
The aging algorithm with $a = 1/2$ is being used to predict run times. The previous four runs, from oldest to most recent, are $40, 20, 40,$ and $15$ msec. What is the prediction of the next time?
The aging algorithm with $a = 1/2$ is being used to predict run times. The previous four runs, from oldest to most recent, are $40, 20, 40,$ and $15$ msec. What is the pr...
User Avatar
Link Copied!