Question: 2.) 15 points] (Exercise 5.11) Assume 4KiB pages, a 4-entry full associative TLB and true LRU replacement. The LRU status at the beginning is shown
![2.) 15 points] (Exercise 5.11) Assume 4KiB pages, a 4-entry full](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2024/09/66f2f48a025f7_34566f2f4897ee91.jpg)

2.) 15 points] (Exercise 5.11) Assume 4KiB pages, a 4-entry full associative TLB and true LRU replacement. The LRU status at the beginning is shown in TLB table. O represents the Least Recently Used and 3 being the Most Recently Used. Page table contains 16 entries shown in Page Table. If pages must be brought in from disk, increment the next largest page number, i.e., when the page table is accessed, if that particular page is on disk, the page number would be 18 since the largest page number in the page table at the beginning is 17. Assume physical memory is large enough. TLB Tag Physical Page Number 8 Valid LRU 3 4 0 10 2 0 7
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
