An inverted page table can be used to further optimize space and time. How many PTEs are needed to store the page table? Assuming a hash table implementation, what are the common case and worst case numbers of memory references needed for servicing a TLB miss?
The following table shows the contents of a 4-entry TLB.
![599_17edede7-cfa9-4135-a33f-e87b520ca28c.png](https://secure.tutorsglobe.com/CMSImages/599_17edede7-cfa9-4135-a33f-e87b520ca28c.png)