moved by
990 views
0 0 votes

A three-level hierarchical page table is used for a system with a 44-bit virtual address divided as follows:

Field         Bits
1st-level index           VA[43:33] (11 bits)
2nd-level index           VA[32:22] (11 bits)
3rd-level index           VA[21:12] (10 bits)
Page offset            VA[11:0] (12 bits)

 

The system uses 64-bit page table entries (PTEs). A complete page table page is allocated even if only one PTE is used. Assume a sufficiently large physical memory and no paging to disk.

Which of the following options correctly gives the minimum and maximum possible page table overhead, respectively?


Options

A. 40 KB and 32 MB
B. 40 KB and 32 GB
C. 48 KB and 16 GB
D. 64 KB and 64 GB

1 Answer

Best answer
3 3 votes
Given:
Virtual address = 44 bits
Split: 11 bits (L1), 11 bits (L2), 10 bits (L3), 12-bit offset
Page size = 4 KB
PTE size = 64 bits = 8 bytes
A full page table page is allocated even if only one entry is used.

First compute page table sizes.

Level-1 page table:
Number of entries = 2¹¹ = 2048
Size = 2048 × 8 = 16384 bytes = 16 KB = 4 pages

Level-2 page table:
Same as level-1
Size = 16 KB = 4 pages

Level-3 page table:
Number of entries = 2¹⁰ = 1024
Size = 1024 × 8 = 8192 bytes = 8 KB = 2 pages

Minimum page table overhead:
If only one virtual page is mapped, still one page table at each level is required.

Level-1: 16 KB
Level-2: 16 KB
Level-3: 8 KB

Total minimum = 16 + 16 + 8 = 40 KB

Maximum page table overhead:
When the entire virtual address space is mapped.

Level-1:
Only one table = 16 KB

Level-2:
One table for each level-1 entry
Number of tables = 2¹¹ = 2048
Total size = 2048 × 16 KB = 32 MB

Level-3:
One table for each level-2 entry
Number of tables = 2¹¹ × 2¹¹ = 2²²
Each table = 8 KB
Total size = 2²² × 8 KB = 32 GB

Maximum overhead is dominated by level-3 tables, so it is 32 GB.

Correct answer:
40 KB and 32 GB (Option B)
selected by
Position:
Show:

Related questions

1 1 vote
0 0 answers
779
779 views
tishhaagrawal asked Dec 5, 2023
779 views
In this question, they have asked for memory requirements for page tables across the levels, solving which I am getting number of level 3 page tables as 2^8. Below is a b...
0 0 votes
0 0 answers
290
290 views
ASH1198 asked Dec 18, 2025
290 views
Consider a multilevel paging scheme where the page tables are not page aligned, suppose there are 3 levels annd if from L1 to address L2 page table we need 25 bits, then ...
6 6 votes
1 1 answer
3.0k
3.0k views
Chaitanya Kale asked Dec 3, 2022
2,967 views
The below question is from made easy test series:Consider a 32 bit virtual address as follows: 10 8 6 8 P1 P2 P3 ...
0 0 votes
1 1 answer
2.0k
2.0k views
Markzuck asked Dec 22, 2018
1,998 views
for memory overhead in Multi level paging, for innermost table only 1 page size shall be counted na? and NOT the complete page table size?please explain the concept, than...