Repeated uncontrollable page faulting is called thrashing, caused by repeatedly
ID: 3720849 • Letter: R
Question
Repeated uncontrollable page faulting is called thrashing, caused by repeatedly swapping pages out of RAM only to have those pages called for immediately after. You need to find a means by which this problem can be solved. Your choices are i) terminate an application whenever thrashing occurs; ii) Add more real memory; iii) increase virtual memory iv) get a faster hard drive. Which is the best choice?
i) as a short-term measure, and ii) as a long-term measure, but not iii) or iv).
ii) as a short-term measure, and iii) as a long-term measure, but not i) or iv)
iii) as a short-term measure, but not i) or ii) or iv)
None of the suggestions given is appropriate.
The size of logical memory is limited by ___ and physical memory is limited by ___
the amount of installed memory ... the size of addressable memory
the size of addressable memory ... the amount of installed memory
the size of the data word ... the size of the MAR
the size of the hard drive ... the access speed of the hard drive
Advantages of using virtual memory include:
Programs share memory space
More programs run at the same time
Programs run even if they cannot fit into memory all at once
all of the above
none of the above
What is(are) possible impact(s) of page sharing among different processes?
a. if code pages are shared but not altered, page faulting can be reduced
b. if data pages are shared and the processes are non-cooperating, access violations will occur
c. both a. and b.
d. neither a. nor b.
When a blocked process receives the requested resources, it is not immediately returned to the running state, but is instead is sent to the ready queue. Why?
a. the decision to execute a process is under the control of the dispatcher which selects a process from those in the ready state.
b. if the blocked process immediately returned to the running state, this could result in a lower priority process taking precedence over a higher priority process.
c. both a. and b.
d. Neither a. not b.
i) as a short-term measure, and ii) as a long-term measure, but not iii) or iv).
ii) as a short-term measure, and iii) as a long-term measure, but not i) or iv)
iii) as a short-term measure, but not i) or ii) or iv)
None of the suggestions given is appropriate.
The size of logical memory is limited by ___ and physical memory is limited by ___
the amount of installed memory ... the size of addressable memory
the size of addressable memory ... the amount of installed memory
the size of the data word ... the size of the MAR
the size of the hard drive ... the access speed of the hard drive
Advantages of using virtual memory include:
Programs share memory space
More programs run at the same time
Programs run even if they cannot fit into memory all at once
all of the above
none of the above
What is(are) possible impact(s) of page sharing among different processes?
a. if code pages are shared but not altered, page faulting can be reduced
b. if data pages are shared and the processes are non-cooperating, access violations will occur
c. both a. and b.
d. neither a. nor b.
When a blocked process receives the requested resources, it is not immediately returned to the running state, but is instead is sent to the ready queue. Why?
a. the decision to execute a process is under the control of the dispatcher which selects a process from those in the ready state.
b. if the blocked process immediately returned to the running state, this could result in a lower priority process taking precedence over a higher priority process.
c. both a. and b.
d. Neither a. not b.
Explanation / Answer
1. None of the suggestions given is appropriate.
Because during this thrashing problem to prevent we can use technologies like Locality Model or working of set model.
2. the size of addressable memory ... the amount of installed memory...
Logical Memory size is always depends on the addressable memory,and the physical memory is depends on installed primary memory.
3. Programs run even if they cannot fit into memory all at once
Because even if the program is big processor will load the required section of the program into memory.
4. c. both a. and b.
5. a. the decision to execute a process is under the control of the dispatcher which selects a process from those in the ready state.