183 views
4 4 votes

Which of the following statements about multi-level page tables are correct?

  1. A multi-level page table may consume more pages than a linear page table for some address-space usage patterns.
     
  2. Page-table memory is generally easier to allocate because lower-level tables are divided into separate page-sized chunks.
     
  3. Without a TLB hit, a multi-level page-table lookup generally requires more lookup accesses than a linear page table.
     
  4. Systems with larger virtual-address spaces commonly use more page-table levels.
     
  5. A TLB reduces the amount of memory occupied by the multi-level page table.

1 Answer

1 1 vote

Statement (A) is correct.

A multi-level page table adds directory and intermediate-level structures.

If mappings are spread across the entire virtual address space, many lower-level tables may be required. The extra levels can make it consume more pages than a linear page table.


Statement (B) is correct.

A large linear page table may require one large contiguous allocation.

A multi-level page table is divided into smaller page-sized chunks, and lower-level tables can be allocated independently.


Statement (C) is correct.

A linear page table requires one page-table-entry lookup.

A two-level page table may require:

$1$ directory access $+1$ page-table access

Additional levels require further accesses when the translation is not found in the TLB.


Statement (D) is correct.

As the virtual-page number becomes larger, additional levels are often used so that each page-table structure remains manageable and page-sized.


Statement (E) is incorrect.

The TLB caches recently used translations and improves translation speed.

It does not reduce the actual number or size of page-table structures stored in memory.

Answer:
Position:
Show:

Related questions

5 5 votes
1 1 answer
151
151 views
GO Classes asked Aug 6
151 views
A system has:$15$-bit virtual addresses Page size $=32$ bytes A two-level page table One-byte PDEs and PTEs Entry format: one valid bit followed by a $7$-bit physical-fra...
1 1 vote
1 1 answer
93
93 views
GO Classes asked Aug 10
93 views
The following virtual-to-physical address translations are observed for a process. All addresses are $32$ bits long.\[\begin{array}{c|c}\text{Virtual address} & \text{Phy...
4 4 votes
1 1 answer
148
148 views
GO Classes asked Aug 6
148 views
A processor experiences a TLB miss while translating an address using a two-level page table.What is the number of main-memory accesses required only for the page-table l...
2 2 votes
1 1 answer
125
125 views
GO Classes asked Aug 6
125 views
Which statement correctly describes the purpose of the valid bit in a page-table entry?It indicates whether the page has been modified. An invalid-bit access causes the p...