Inverted Page Table
With each process having its own page table, and with each page table consuming considerable amount of memory…We use a lot of memory to keep track of memory.
Inverted page table has one entry for each real page of memory.
Lookup time is increased because it requires a search on the inverted table.
Hash table can be used to reduce this problem.
Of course, we should also use TLB.