Virtual Memory Management

From the study guide

Course Outline

  1. Page Table Size and Reduction
  2. Hierarchical Page Tables
  3. Hashed and Inverted Page Tables
  4. Demand Paging and Page Faults
  5. Thrashing
  6. Segmentation and Address Translation
  7. Combined Paging and Segmentation
  8. Multilevel Page Table Calculation

1. Page Table Size and Reduction

★ Must-know

  • With a 32-bit virtual address, 4 KB pages, and 4-byte page-table entries, a single-level page table has 1,048,576 entries and occupies 4 MB per process.

Further detail

  • Page-table size can be reduced using:
    • hierarchical page tables
    • hashed page tables
    • inverted page tables

2. Hierarchical Page Tables

Key Concepts & Definitions

  • Hierarchical paging: Divides the virtual address space into multiple page tables, effectively paging the page table itself.
Read the full study guide →

Practice quiz preview

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?

Take the quiz (18 questions) →

Flashcard preview

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.

See all 45 flashcards →

Frequently asked questions

What does the Virtual Memory Management study guide cover?

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 →

How many questions are in the Virtual Memory Management quiz?

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) →

How do I study Virtual Memory Management with flashcards?

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 →

Related classes

Turn your own class notes into a study guide

Upload a PDF or paste your notes. Revizly writes a study guide, a practice quiz and flashcards in about a minute.