Register

Galvin Edition 9 Exercise 9 Question 15 (Page No. 452)

542 views
0 votes
0 votes

A simplified view of thread states is $Ready$, $Running$, and $Blocked$,where a thread is either ready and waiting to be scheduled, is running on the processor, or is blocked (for example, waiting for I/O). This is illustrated in Figure 9.31. Assuming a thread is in the Running state, answer the following questions, and explain your answer:


a. Will the thread change state if it incurs a page fault? If so, to what state will it change?
b. Will the thread change state if it generates a $TLB$ miss that is resolved in the page table ? If so, to what state will it change?
c. Will the thread change state if an address reference is resolved in the page table? If so, to what state will it change?

User Avatar

1 Answer

1 votes
1 votes

A. On a page fault the thread state is set to blocked as an I/O operation is required to bring the new
page into memory.
B. On a TLB-miss, the thread continues running if the address is resolved in the page table.
C. The thread will continue running if the address is resolved in the page table.

Ref:

CHAPTER 9

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

Related questions

0 votes
0 votes
0 answers
3
akash.dinkar12 asked Mar 21, 2019
204 views
Galvin Edition 9 Exercise 9 Question 13 (Page No. 452)
We have an operating system for a machine that uses base and limit registers, but we have modified the machine to provide a page table. Can the page tables be set up to simulate base and limit registers ? How can they be, or why can they not be?
We have an operating system for a machine that uses base and limit registers, but we have modified the machine to provide a page table. Can the page tables be set up to s...
User Avatar
0 votes
0 votes
0 answers
4
akash.dinkar12 asked Mar 22, 2019
304 views
Galvin Edition 9 Exercise 9 Question 37 (Page No. 456)
The slab-allocation algorithm uses a separate cache for each different object type. Assuming there is one cache per object type, explain why this scheme doesn’t scale well with multiple CPUs. What could be done to address this scalability issue?
The slab-allocation algorithm uses a separate cache for each different object type. Assuming there is one cache per object type, explain why this scheme doesn’t scale w...
User Avatar
Link Copied!