โ Must-know
Further detail
โ Must-know
Further detail
The VAX minicomputer was sold between 1977 and 2000 and used a 32-bit virtual address space with 512-byte pages, divided into four 2ยณโฐ-byte sections.
A VAX virtual address uses 2 bits to specify the section, 21 bits for the page number within that section, and 9 bits for the page offset.
For a 64-bit virtual address with 4 KB pages and 4-byte entries, an inner page table has 2ยนโฐ entries and fits in one page, but the outer page table has 2โดยฒ entries and occupies 2โดโด bytes.
A 64-bit system may require up to seven paging levels, causing seven memory accesses to translate a virtual address; this is considered unacceptable.
Picture a page table itself split across pages, with each address choosing a table before choosing a page.
๐ An inverted page table reduces page-table memory use but increases search time; hashing can reduce that search time at the cost of one extra memory access.
Hashed tables start from a virtual page number; inverted tables start from each real memory page.
โ Must-know
Further detail
๐ A lazy pager loads individual pages only when needed, whereas a lazy swapper swaps all pages of a process as a whole.
Validate, allocate, load, update, mark valid, restart.
โ Must-know
Further detail
Too few frames โ constant paging โ low CPU utilization.
โ Must-know
๐ A segmented logical address is an error if its offset is outside the segment limit; otherwise its physical address is the segment base plus the offset.
Further detail
A C compiler may create separate segments for:
Each segment-table entry contains a segment base, which gives the segment's starting physical address, and a segment limit, which gives its length.
With segment 2 starting at physical address 4300, virtual address โจ2,53โฉ resolves to physical address 4353.
With segment 3 starting at physical address 3200, virtual address โจ3,852โฉ resolves to physical address 4052.
Virtual address โจ0,1222โฉ is invalid because segment 0 is 1000 bytes long and offset 1222 exceeds its limit.
A segment uses a base and a limit; paging maps pages to frames.
โ Must-know
Further detail
โ Must-know
Further detail
Take a 18-question practice quiz on Virtual Memory Management, with every answer explained.
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?
Memorize the key concepts of Virtual Memory Management with 45 flashcards.
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.
Upload your class notes and Revizly writes a study guide, a quiz and flashcards in about a minute.
Study guide maker