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.
How many page tables does an inverted page-table system use?
One page table for all processes in the system.
When does demand paging load pages into physical memory?
Only when they are needed during program execution.
What does a valid bit indicate about a page?
The page is in main memory.
What happens when an invalid page is referenced?
A page fault occurs.
What happens first when the operating system handles a page fault?
It validates the reference.
What is thrashing in a process’s memory activity?
Thrashing is spending most of the time swapping pages because there are too few frames.
Why does thrashing cause low CPU utilization?
Processes spend most of their time paging instead of doing useful work.
What does segmentation divide virtual memory into?
Multiple virtual address spaces called segments.
What does each component of a segmented virtual address ⟨s,d⟩ represent?
s identifies the segment, and d is the offset within it.
How is a segmented logical address translated when its offset is within the limit?
The segment base plus the offset.
On the Intel Pentium, what does the segmentation unit translate a virtual address into?
A linear address.
On the Intel Pentium, what does the paging unit translate a linear address into?
A physical address.
In a 64-bit virtual-address system with 2048-byte pages, how many offset bits are used?
11 bits.
After an 11-bit offset, how many virtual-address bits remain for the page number?
53 bits.
With 53 page-number bits and 9 index bits per level, how many page-table levels are required?
6 levels.
Which page-table structures can reduce page-table size?
Hierarchical, hashed, or inverted page tables.
When was the VAX minicomputer sold?
From 1977 to 2000.
How many sections divide the VAX 32-bit virtual address space?
Four sections of bytes each.
How many bits specify the section in a VAX virtual address?
2 bits.
How many bits specify the page number within a VAX section?
21 bits.
How large is the outer page table for a 64-bit address with 4 KB pages and 4-byte entries?
bytes.
Why are up to seven paging levels considered unacceptable on a 64-bit system?
They can require seven memory accesses to translate a virtual address.
What does each hashed page-table list element contain?
The virtual page number, mapped page-frame value, and pointer to the next element.
How does hashed address translation find a page frame?
It hashes the virtual page number, searches for a matching entry, and returns the corresponding page-frame address.
What does each inverted page-table entry store about its page?
The page’s virtual address and information about the process that owns it.
What is the memory-use and search-time tradeoff of an inverted page table?
It reduces page-table memory use but increases search time.
What is the cost of using hashing to reduce inverted page-table search time?
One extra memory access.
What memory benefit does demand paging provide?
It reduces memory consumption.
What response-time benefit does demand paging provide?
It provides faster response times.
How can an operating system worsen thrashing after observing low CPU utilization?
It may add more processes, worsening the thrashing problem.
Which separate segments may a C compiler create?
Code, global variables, the heap, each thread's stack, and the standard C library.
What does a segment-table entry's base specify?
The segment's starting physical address.
What physical address does ⟨2,53⟩ resolve to when segment 2 starts at 4300?
4353.
Where does virtual address ⟨3,852⟩ resolve if segment 3 starts at physical address 3200?
Physical address 4052.
Why is virtual address ⟨0,1222⟩ invalid when segment 0 is 1000 bytes long?
Its offset exceeds the segment limit.
Which memory-management modes does the Intel Pentium support?
Pure segmentation and segmentation combined with paging.
With 4-byte entries and 2048-byte pages, how many entries fit in each page-table page?
512 entries.
How many index bits per level are needed for 512 page-table entries?
9 bits.
How does a lazy pager differ from a lazy swapper?
A lazy pager loads individual pages on demand; a lazy swapper moves an entire process at once.
Answer 18 questions on Virtual Memory Management.
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?
Go over the full study guide for Virtual Memory Management.
Read the study guide →Upload your class notes and Revizly writes your flashcards in about a minute.
Flashcard maker