What is the . Let us define “most-recently-used” (MRU) as a page removal algorithm that removes from memory the most recently used page. Perform a page trace analysis using three page frames and the page requests from the previous exercise. Compute the failure and success ratios and explain why you think MRU is, or is not, a viable memory allocation system
2 answers
Just a gut feeling, I'd say it is not. The MRU page is likely to be the next page accessed, don't you think? Swapping it out is likely to be a waste of time.
Let us define “most-recently-used” (MRU) as a page removal algorithm that
removes from memory the most recently used page. Perform a page trace
analysis using three page frames and the page requests from the previous exercise. Compute the failure and success ratios and explain why you think MRU
is, or is not, a viable memory allocation system.
removes from memory the most recently used page. Perform a page trace
analysis using three page frames and the page requests from the previous exercise. Compute the failure and success ratios and explain why you think MRU
is, or is not, a viable memory allocation system.