Virtual Memory Flashcards
What is the benefit of using sparse addresses in virtual memory?
Explain the distinction between a demand-paging system and a paging system with swapping
Explain the sequence of events that happens when a page-fault occurs
How is the effective access time computed for a demand-paged memory system?
Explain how copy-on-write operates
Explain the usefulness of a modify bit
How does the second-chance algorithm for page replacement differ from the FIFO page replacement algorithm?
Explain the distinction between global allocation versus local allocation
Why doesn’t a local replacement algorithm solve the problem of thrashing entirely?
What are the benefits of using slab allocation to allocate kernel memory?
Explain the concept behind prepaging
Discuss two strategies for increasing TLB reach
How are lock bits useful in I/O requests?
Explain how working set model works.
T/F - A page fault must be preceded by a TLB miss
T/F - The instruction that causes a page fault needs to be re-executed after the fault has been handled.
T/F - Stack algorithms can never exhibit Belady’s anomaly.
True
examples of Stack Algorithms: LRU, Optimal Replacement
T/F - Some operating systems keep a pool of free frames so that the frequency of page faults is lowered.
T/F - Some operating systems provide raw disk, so that special applications can bypass file system when accessing secondary storage.
T/F - A reaper starts reclaiming pages as soon as the number of free frames falls below the maximum threshold.
T/F - The current best practice to avoid thrashing is to include enough physical memory.
T/F - The buddy system for allocating kernel memory is very likely to cause fragmentation within the allocated segments.
T/F - In Linux, a slab may only be either full or empty.
T/F - Prepaging an executable program is much easier than prepaging a text file.
