Hashed Page Table

Q1. Explain Hashed Page Table.

Ans.A common approach for handling address spaces larger than 32 bits is to usea hashed page table, with the hash value being the virtual page number. Eachentry in the hash table contains a linked list ofelements that hash to the same location (to handle collisions). Each element consists of three fields:


(1) the virtual page number,

(2) the value of the mapped page frame, and (

3) a pointer to the next element in the linked list.


The algorithm works as follows: The virtual page number in the virtual address is hashed into the hash table. The virtual page number is compared with field 1 in the first element in the linked list. If there is a match, the corresponding page frame (field 2) is used to form the desired physical address. If there is no match, subsequent entries in the linked list are searched for a matching virtual page number.

Figure: Hashed Page Table

Leave a Reply

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

%d bloggers like this: