-
A computer with an 8 KB page, a 256 MB main memory, and a 64GB virtual address space uses an inverted page table to implement its virtual memory. How big should the hash table(page table) be to ensure a mean hash chain length of less than 1? Assume that the hash table size is a power of two.
The hashed page table works as follows
The virtual page number is hashed into a hash table. The hash table contains a chain of elements hashing to the same location. Each element contains
(1) the virtual page number
(2) the value of the mapped page frame
(3) a pointer to the next element
-
16384
-
32768
-
65536
-
None of these
