FlashKeepers

Computer Science · College · College and University

Operating Systems, Unit 7: Virtual Memory

Operating Systems, unit: Virtual Memory. Core concepts, terminology, and worked-example cues a college student meets for this unit, building on prior units without repeating them. Front: a term, concept, or short problem cue. Back: the definition, explanation, or answer.

About this set

37 basic cards for College Computer Science. Set 7 of 8 in Operating Systems. It opens with "What is virtual memory?" and "What is the main benefit of virtual memory?". Study it alongside the other College sets below.

37 cards · basic cards · AI-written, checked twice. Edit anything.

Study this set free Look inside first Get FlashKeepers for iPhone

Opens in your browser, no account. Get the iPhone and iPad app · Android app

What is virtual memory?
Show answerA memory management technique that gives processes the illusion of a large, contiguous address space, backed partly by disk
What is the main benefit of virtual memory?
Show answerPrograms can run without being limited by the amount of physical RAM installed
What is demand paging?
Show answerLoading a page into physical memory only when it is actually accessed, not in advance
What is swapping?
Show answerMoving a process's memory between RAM and disk to free up physical memory
What is a swap space (or swap file)?
Show answerA reserved area of disk used to hold pages swapped out of physical memory
What is thrashing?
Show answerA condition where a system spends most of its time swapping pages in and out, with little actual progress
What causes thrashing?
Show answerToo many processes competing for too little physical memory, causing excessive page faults
What is a page replacement algorithm used for?
Show answerDeciding which page to remove from memory when a new page needs to be loaded and memory is full
What is the FIFO page replacement algorithm?
Show answerReplacing the oldest page that was loaded into memory
What is the Least Recently Used (LRU) page replacement algorithm?
Show answerReplacing the page that has not been used for the longest time
What is the Optimal page replacement algorithm?
Show answerReplacing the page that will not be used for the longest time in the future (a theoretical best case)
What is Belady's Anomaly?
Show answerA counterintuitive phenomenon where increasing the number of page frames can increase the number of page faults, seen in FIFO
What is the working set of a process?
Show answerThe set of pages a process is actively using during a given time window
What is the effective access time affected by page faults?
Show answerIt increases significantly, since disk access is far slower than RAM access
What is copy-on-write, as a memory optimization?
Show answerSharing memory pages between processes until one attempts to modify it, at which point a private copy is made

22 more cards in the app

Study this set free