Inverted Page Table

Q1. Explain Inverted Page Table.

Ans.An inverted page table has one entry for each real page(or frame) of memory. Each entry consists of the virtual address of the page stored in that real memory location; with information about the process that owns that page. Thus, only one page table is in the system, and it has only one entry for each page of physical memory.  Inverted page tables often require that an address-space identifier be stored in each entry of the page table, since the table usually contains several different address spaces mapping physical memory. Storing the address-space identifier ensures that a logical page for a particular process is mapped to the corresponding physical page frame.


Examples of systems using inverted page tables include the 64-bit UltraSPARC and PowerPC.

Figure: Inverted Page Table

Leave a Reply

Your email address will not be published. Required fields are marked *

%d bloggers like this: