(a) The PowerPC uses a hardware managed TLB with an inverted page table. Discuss its advantages and disadvantages. i.e., What are the implications of the inverted page table on the size of each page table entry? What about a page table walk (how many memory references are potentially required on a TLB miss)? Are per-process page tables necessary or can they be eliminated?
(a) The PowerPC uses a hardware managed TLB with an inverted page table. Discuss its advantages and
disadvantages. i.e., What are the implications of the inverted page table on the size of each page table entry? What
about a page table walk (how many memory references are potentially required on a TLB miss)? Are per-process page
tables necessary or can they be eliminated?
(b) A stack page replacement
be shown that at any given time, the set of pages in memory for n frames is always a subset of the set of pages that
would be in memory with n + 1 frames for the same sequence of accesses. Prove that OPT and LRU (least recently
used) are stack algorithms.
![](/static/compass_v2/shared-icons/check-mark.png)
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![Systems Architecture](https://www.bartleby.com/isbn_cover_images/9781305080195/9781305080195_smallCoverImage.gif)
![Systems Architecture](https://www.bartleby.com/isbn_cover_images/9781305080195/9781305080195_smallCoverImage.gif)