Discussion
In a two-level page table, the outer table contains
Answer: C
Correct answer: pointers to the inner page tables
In a two-level scheme the outer table holds pointers to inner page tables, and the inner tables hold the frame numbers. The logical address splits into three parts: an index into the outer table, an index into the inner one, and an offset. The reason for the arrangement is size. A 32-bit address space with 4 KB pages needs a million page-table entries per process, which at four bytes each is 4 MB of contiguous memory - unacceptable for every process. Splitting the table means only the outer table and the inner tables actually in use need exist; the rest are simply absent, and most processes use a small part of their address space. The cost is another memory access per translation, which is why the TLB matters so much. 64-bit architectures need three or four levels for the same reason, and the alternative approaches are the hashed page table and the inverted page table, which keeps one entry per physical frame rather than per virtual page.
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development