★ Must-know
Further detail
1. A process uses a 32-bit virtual address space, 4 KB pages, and 4-byte page-table entries. How large is its single-level page table?
2. A system designer wants to reduce the memory required for page tables. Which set names methods that can do this?
3. A memory system breaks a virtual address space into multiple page tables, thereby paging the page table itself. What is this organization called?
How many entries does a single-level page table have with a 32-bit virtual address and 4 KB pages?
1,048,576 entries.
How much memory does that page table occupy per process with 4-byte entries?
4 MB.
How does hierarchical paging organize virtual address space?
It divides the virtual address space into multiple page tables, effectively paging the page table itself.
How is a 32-bit virtual address divided in a two-level page table with 4 KB pages?
A 10-bit outer-table index, a 10-bit inner-table index, and a 12-bit page offset.
Where does a hashed page table map a virtual page number?
To a table location whose entry points to a linked list of entries sharing its hash value.
How many entries does an inverted page table have per real memory page?
One entry.
It covers the core concepts of Virtual Memory Management, organized by topic with the key definitions, explanations and takeaways, so it's easier to learn and remember.
Read the full study guide →The practice quiz has 18 multiple-choice questions, each with an explanation. Use it to check what you know and find your gaps.
Take the quiz (18 questions) →There are 45 flashcards on Virtual Memory Management, with a question on the front and the answer on the back. Try to recall each answer before you flip, and let spaced repetition bring back the ones you miss.
See all 45 flashcards →Upload a PDF or paste your notes. Revizly writes a study guide, a practice quiz and flashcards in about a minute.