Question

a. How much memory space is needed for the user page table of Figure?
b. Assume you want to implement a hashed inverted page table for the same addressing scheme as depicted in Figure, using a hash function that maps the 20-bit page number into a 6-bit hash value. The table entry contains the page number, the frame number, and a chain pointer. If the page table allocates space for up to 3 overflow entries per hashed entry, how much memory space does the hashed inverted page table take?


$1.99
Sales0
Views76
Comments0
  • CreatedMay 09, 2015
  • Files Included
Post your question
5000