Paging and virtual memory

What is paging?

Paging is a memory management scheme that eliminates the need for contiguous allocation of physical memory. It divides virtual memory into fixed-size blocks called pages and maps them to physical memory frames.

True or False: Paging requires contiguous memory allocation.

False. Paging allows non-contiguous memory allocation by mapping pages to any available physical frames.

Define a page.

A page is a fixed-size block of virtual memory, typically ranging from 4KB to 64KB, used in paging systems to simplify memory management.

What is a frame?

A frame is a fixed-size block of physical memory that corresponds to a page in virtual memory. Frames hold the actual data and instructions that the CPU uses.

Fill in the blank: The size of a page is typically equal to the size of a _____

Frame. This allows for easy mapping between virtual and physical memory.

Compare page size and frame size.

Both page size and frame size are always the same. This ensures efficient mapping of virtual memory to physical memory.

What is a page table?

A page table is a data structure used to store the mapping between virtual pages and physical frames. It also holds metadata such as access permissions.

True or False: A page fault occurs when a page is found in physical memory.

False. A page fault happens when a page is not found in physical memory, requiring a loading process from disk to RAM.

Cause → Effect: What causes a page fault?

Accessing a page that is not currently loaded in physical memory causes a page fault, leading to retrieving the page from disk storage.

What is a dirty page?

A dirty page is a page in physical memory that has been modified. It must be written back to disk before it can be replaced.

Define page replacement.

Page replacement is the process of removing pages from physical memory to make space for new pages when the memory is full.

Fill in the blank: Demand paging loads pages into memory _____

Only when they are needed, minimizing memory usage.

What are logical addresses?

Logical addresses are generated by the CPU and refer to pages in the virtual memory space, which are mapped to physical addresses via the page table.

True or False: The operating system manages the page table.

True. The operating system is responsible for managing the page table and handling page faults.

What is segmentation in relation to paging?

Segmentation divides memory into variable-sized segments, while paging divides it into fixed-size pages. Paging can be used within segments for efficient memory management.

What is a page frame?

A page frame is a fixed-size block of physical memory that holds a page. It's the basic unit of memory allocation in a paging system, allowing the operating system to efficiently manage memory by mapping logical pages to these frames.

Virtual Memory

A memory management technique that gives an application the illusion of a large memory space by using disk space to extend RAM.

True or False: Virtual memory eliminates the need for physical RAM.

False. Virtual memory complements physical RAM by allowing more processes to run simultaneously.

Page Fault

An event that occurs when a program accesses a page not currently mapped to physical memory, triggering a data fetch from disk.

How does virtual memory improve multitasking?

It allows multiple processes to run concurrently by allocating portions of physical memory and disk space dynamically.

Segmentation vs. Paging

Segmentation divides memory into variable-sized segments, while paging divides it into fixed-size blocks called pages.

Swapping

The process of moving data between physical memory and disk storage, often to free up RAM for active processes.

How are page sizes determined?

Page sizes are typically determined by the hardware architecture, balancing overhead and fragmentation.

True or False: Virtual memory directly accesses the hard drive.

False. Virtual memory uses a mapping system to access data on the hard drive indirectly.

Demand Paging

A method of loading pages into memory only when they are needed, reducing memory usage and speeding up loading times.

TLB (Translation Lookaside Buffer)

A cache that stores recent translations of virtual addresses to physical addresses, improving lookup speed.

Fill in the blank: The __________ allows processes to use more memory than is physically available.

Virtual memory.

Thrashing

A condition where excessive paging leads to decreased performance due to constant loading and unloading of pages.

What happens on a page fault?

The operating system locates the requested page on disk, loads it into memory, and updates the page table.

Page Table

A data structure used to maintain the mapping between virtual addresses and physical memory locations.

Resident Set

The subset of pages that are currently loaded into physical memory for a process.

How does virtual memory use disk space?

It utilizes a designated swap space or file on the disk to temporarily store pages that are not in active use.

True or False: All processes share the same page table.

False. Each process has its own page table to maintain its virtual-to-physical address mapping.

Memory Management Unit (MMU)

A hardware component that translates virtual addresses to physical addresses and manages memory access protections.

Working Set Model

A concept that defines the set of pages actively used by a process over a period, guiding memory allocation.

How does fragmentation occur in virtual memory?

Fragmentation occurs when free memory is split into small blocks, making it difficult to allocate large contiguous spaces.

Paging

A memory management scheme that eliminates the need for contiguous allocation of physical memory. It divides virtual memory into blocks of physical memory called pages.

Page Table

A data structure used to store the mapping between virtual addresses and physical addresses. It keeps track of where each page is stored in physical memory.

True or False: Paging requires contiguous memory allocation.

False. Paging allows non-contiguous memory allocation, improving memory management efficiency.

Page Frame

A fixed-length block of physical memory into which pages are loaded. Each page frame can hold exactly one page of data.

What happens during a page fault?

When a program accesses a page not currently in memory, the operating system is triggered to load the page from disk into a free page frame.

Fill in the blank: The process of loading a page from disk is called __________.

Page Swapping.

Demand Paging

A technique where pages are loaded into memory only when they are needed, rather than pre-loading all pages at startup. This conserves memory and improves efficiency.

What is a page replacement algorithm?

An algorithm used to decide which page to remove from memory when a new page needs to be loaded. Examples include LRU and FIFO.

Cause → Effect: Running out of physical memory

Leads to increased page faults and can degrade system performance due to excessive paging.

Comparison: LRU vs. FIFO

LRU (Least Recently Used) replaces the page that has not been used for the longest time. FIFO (First-In, First-Out) replaces the oldest page in memory.

Working Set Model

A concept that aims to keep the most frequently used pages in memory to minimize page faults and improve performance.

Thrashing

A condition where excessive paging occurs, causing the system to spend more time swapping pages in and out of memory than executing processes.

What is a page size?

The fixed amount of data that a page holds, typically ranging from 4KB to 64KB, influencing the efficiency of memory usage.

Page Fault Rate

The ratio of the number of page faults to the total memory accesses. A high page fault rate indicates poor memory management.

Segmentation vs. Paging

Segmentation divides memory into variable-sized segments; paging divides it into fixed-size pages. Paging simplifies memory management.

What is a TLB?

Translation Lookaside Buffer. A cache used to reduce the time taken to access the page table by storing recent translations of virtual to physical addresses.

Fill in the blank: The primary storage device for pages in a paging system is __________.

The hard disk.

Page Replacement Algorithms

Techniques to choose which memory page to replace. Important types include: - LRU - FIFO - Optimal

What does a page hit mean?

When the required page is found in memory, avoiding a page fault. This is desirable for system performance.

What is a paging mechanism?

A paging mechanism is a technique that enables the computer's operating system to retrieve processes from the secondary storage in blocks, known as pages, effectively managing physical memory and optimizing the use of available resources.

What is thrashing?

Thrashing occurs when a system spends more time swapping pages in and out of memory than executing processes. This drastically reduces performance.

True or False: Larger page sizes always improve performance.

False. Larger page sizes can lead to higher internal fragmentation, which might waste memory and degrade performance.

Page fault rate → performance impact.

High page fault rates indicate frequent memory accesses to pages not in RAM, resulting in slower performance as the system must fetch pages from disk.

What is locality of reference?

Locality of reference refers to the tendency of a process to access a relatively small portion of its address space repeatedly over a short period.

Fill in the blank: Increasing _____ can reduce page fault rates.

The working set size can reduce page fault rates by ensuring that frequently accessed pages remain in memory.

Comparing demand paging and prepaging.

Demand paging loads pages only when they are needed, whereas prepaging loads pages before they are referenced, reducing future page faults.

How does caching improve performance?

Caching keeps frequently accessed data in faster storage, reducing the time needed to retrieve data compared to fetching from slower main memory.

What is a working set?

A working set is the set of pages that a process is currently using. Keeping this set in memory can enhance performance.

Cause → effect of high memory pressure.

High memory pressure leads to increased page swapping, which can cause thrashing and significantly slow down system performance.

How can page replacement algorithms affect performance?

The choice of page replacement algorithm (e.g., LRU, FIFO) can greatly influence the number of page faults and overall efficiency of memory usage.

True or False: More RAM always leads to better virtual memory performance.

True. More RAM allows more pages to be kept in memory, reducing page faults and improving performance.

What is prefetching in virtual memory?

Prefetching involves loading pages into memory before they are needed, based on predicted access patterns, to minimize page faults.

What are the benefits of using smaller pages?

Smaller pages can reduce internal fragmentation and increase the likelihood that a process's working set fits in memory, improving performance.

Cause → effect of a high degree of multiprogramming.

A high degree of multiprogramming can lead to increased contention for memory resources, raising the likelihood of page faults and reducing performance.

How does the access time differ between RAM and disk?

Access time for RAM is typically in nanoseconds, while disk access time is in milliseconds, making RAM significantly faster.

What is a page replacement algorithm?

A page replacement algorithm decides which page to remove from memory when a new page needs to be loaded, impacting system performance.