6.5. Virtual Memory

Virtual memory allows a system to use more memory than is physically available by swapping data between RAM and disk storage.

Virtual memory is a memory management technique that enables a computer to compensate for physical memory shortages. It achieves this by using a portion of the computer's disk space as if it were additional RAM. When the system stalls due to insufficient RAM, it can transfer some unused data from RAM to a designated area on the disk called swap space. This process allows the operating system to run larger applications than what the available physical memory (RAM) would permit.

Think of virtual memory like an extra filing cabinet that you can use for documents that don't need to be accessed right away. Your desk (RAM) can only hold a few papers you're currently working with, but you can keep other documents in the filing cabinet (disk storage) and pull them out as you need them, even though this takes a little longer.

Memory is divided into fixed-size pages, and data is swapped between physical memory and disk storage (swap space).

In a page-based virtual memory system, the allocations in RAM are divided into small blocks, typically called pages. Each page is a fixed size, making it easier for the operating system to manage memory efficiently. When a program needs more memory than what is physically available, the OS identifies which pages are not currently being used and swaps these with pages from the disk space. This swapping process is handled automatically, which creates an illusion for applications that they have access to a much larger memory space than is physically installed.

Imagine you have a bookshelf (RAM) that can only hold a limited number of books (pages). When you want to read a new book but there’s no space, you put an old book back in a box (disk storage) to make room for the new one. Whenever you want to access the old book again, you swap it back from the box to the shelf, which is slower than grabbing a book that's already on the shelf.

○ Page Table: A data structure that maps virtual addresses to physical addresses in memory. ○ TLB (Translation Lookaside Buffer): A small, fast cache that stores recent virtual-to-physical address translations to speed up address translation.

When a program attempts to access a memory address, it uses a virtual address. The page table is a critical component that the operating system uses to translate this virtual address into an actual physical address in RAM. Every virtual address corresponds to a physical address in the memory, and the page table allows the CPU to find the right location by mapping the two. The Translation Lookaside Buffer (TLB) is a quick-access cache that temporarily stores these translations, which speeds up the process of address conversion and improves performance.

Consider the page table like a library catalog that tells you where to find specific books (physical addresses) based on their titles (virtual addresses). The TLB is like a quick-reference guide or index that helps you find information a bit faster without having to browse through the entire catalog each time you need a book.

○ Process Isolation: Each process gets its own private address space. ○ Efficient Use of Memory: Allows processes to use more memory than physically available through swapping.

Virtual memory offers several advantages. One significant benefit is process isolation, meaning each process runs in its own separate memory space. This isolation prevents processes from interfering with each other, enhancing system stability and security. Additionally, virtual memory allows effective utilization of the available memory by letting processes utilize more memory than may actually be present. This means applications can run more comfortably without crashing due to memory limits.

Think of process isolation like individual offices for different employees in a company. Each employee has their own space where they can work without being disturbed or interfering with others during their tasks. Meanwhile, the company (the computer) can have a flexible strategy about how many resources (desks, files) are needed, using only what is available without overcrowding.

A page fault occurs when a program accesses a page that is not currently in physical memory, requiring the operating system to load the page from disk, causing latency.

A page fault happens when a program attempts to access data stored in a page that is not currently loaded in physical RAM, indicating that data must be retrieved from disk storage. This process introduces latency or delays because accessing information from a disk is significantly slower than accessing it from RAM. The operating system must find the correct page in the disk, load it into memory, potentially swapping another page out to make space, and only then can the program continue its execution.

Imagine you’re reading a series of documents and suddenly realize that you need an important reference document that’s stored in a different room (disk storage) rather than on your desk (RAM). You have to get up, find the document, and bring it back to your desk, which takes extra time. This is similar to what happens during a page fault: there’s a delay as data is retrieved from long-term storage.

--