- The inverted page table has one entry for each memory frame.
- Entry is virtual address of page stored in real location, with information about owning process
- Decreases memory to store page table, increases time to search for page translation
- Hashing is used to speedup table search. Hash table limits search to O(1) entries
- Popular with virtual space
physical
- Hard to handle aliases (
1 virtual page maps to 1 physical page)
- The inverted page table can either be per process or system-wide. In the latter case, a new entry, PID (process id)is added to the table.
- Adv: independent of size of address space; small table(s) if we have large logical address spaces.
2004-05-25
