2,128 views

1 Answer

1 votes
1 votes

When a program occupies only a small portion of its large virtual address space, a hashed page table might be preferred due to its smaller size. The disadvantage with hashed page tables however is the problem that arises due to conflicts in mapping multiple pages onto the same hashed page table entry. If many pages map to the same entry, then traversing the list corresponding to that hash table entry could incur a significant overhead; such overheads are minimal in the segmented paging scheme where each page table entry maintains information regarding only one page.

Ref:

CHAPTER 8

Related questions

1 votes
1 votes
1 answer
1
akash.dinkar12 asked Mar 21, 2019
824 views
Explain why sharing a reentrant module is easier when segmentation is used than when pure paging is used.
0 votes
0 votes
0 answers
2
0 votes
0 votes
0 answers
4
akash.dinkar12 asked Mar 21, 2019
243 views
Consider the hierarchical paging scheme used by the $VAX$ architecture. How many memory operations are performed when a user program executes a memory-load operation ?