Skip to content

Latest commit

 

History

History
101 lines (71 loc) · 7.05 KB

14_Shared Physical Memory Frames.md

File metadata and controls

101 lines (71 loc) · 7.05 KB
Raw

Multiple Process Scenario 📘

1. Shared Physical Memory Frames

  • Physical memory frames are not exclusive to a single process;
    • they are shared among all processes running on a system.
      • Even when multiple processes are running, their physical pages do not necessarily have to be contiguous in the physical memory.

2. Page Table and Physical Pages

  • A page table guides how physical pages are mapped and indicates that they need not be contiguous in physical memory.
  • For instance, page number 0 and page number 1 of a process might be stored in non-continuous frames (e.g., F3 and F5) in physical memory.

4. Free Frame Allocation

  • Any free frame in physical memory can be assigned to a physical page of a process.
  • This allocation is influenced by the page replacement algorithm employed by the OS.

5. Page Replacement Algorithm

  • The OS uses a page replacement algorithm to determine in which frame it should load a physical page of a currently executing process.
  • This is an essential concept but has not been detailed in the provided content and would be discussed later.

🤔 Curiosity

Question 1: What is a Page Table and how does it aid in managing memory?

Answer: A page table is a data structure used by a virtual memory system in a computer operating system to store the mapping between virtual addresses and physical addresses. It helps the system locate the physical frame where a page is stored when a process refers to it using a virtual address.

Question 2: Why is it essential that physical memory frames are shared among all processes in a system?

Answer: Shared physical memory frames optimize memory usage, ensuring that all processes can access necessary memory resources. It allows processes to run without needing contiguous memory frames, making memory management flexible and efficient and ensuring that processes do not monopolize memory resources, thus maintaining a balanced and equitable system.

Question 3: Can a physical memory frame hold pages from different processes simultaneously?

Answer: No, a single physical memory frame cannot hold pages from different processes at the same moment in time. One frame holds one page of a single process. However, it can hold pages from different processes at different times, based on the page replacement algorithm and memory management by the OS.

Question 4: How does a page replacement algorithm influence the performance of memory management in an OS?

Answer: A page replacement algorithm determines how the OS selects the page in memory to be replaced and written back to the disk when a new page is to be loaded into memory. The efficiency of the algorithm affects how quickly and effectively the OS can retrieve and store data in physical memory, influencing the system’s overall performance and how well it manages its available memory resources.

Question 5: What factors determine the selection of a particular page replacement algorithm by an OS?

Answer: Several factors, like the system's hardware, workload characteristics, the performance requirement of applications, and system overhead, influence the selection of a page replacement algorithm. It's crucial to choose an algorithm that minimizes page faults and optimizes memory access speed while considering the system’s specific context and needs.

Question 6: What might be the challenges of managing physical memory frames among multiple processes?

Answer: Challenges may include ensuring fair access to memory resources among all processes, managing memory coherency, preventing deadlock situations, minimizing page faults, and optimizing the page replacement to ensure that the OS performs effectively and that processes do not face unnecessary delays.

🗣 Concepts in Simple Words

1. Shared Physical Memory Frames

Physical memory frames are like storage boxes in a computer's memory. All running programs (processes) can use these boxes to store their data. They don’t have their own dedicated boxes but share them to use space efficiently.

2. Page Table and Physical Pages

Imagine a book (process) having its pages (physical pages) scattered and stored in different drawers (frames) instead of being stacked together. The page table is like an index, telling us which page of the book is in which drawer.

4. Free Frame Allocation

Empty boxes (free frames) can store pages from any process, and choosing which page goes where is decided by certain rules (page replacement algorithm) set by the computer’s manager (operating system).

5. Page Replacement Algorithm

It's like a strategy or set of rules which the computer’s manager uses to decide which data (page) to move out and store elsewhere when a new data (page) needs to be stored in a box (frame).

Diagram to represent the concept of Shared Physical Memory Frames in a computer system with two processes running simultaneously:

Diagram

+---------------------+       +---------------------+
| Physical Memory     |       | Page Table for      |
| Frames (PMF)        |       | Process 1 (P1)      |
+---+---+---+---+---+ |       +---+---+---+---+---+ |
|F0 |F1 |F2 |F3 |F4 | |       |P0 |P1 |P2 |P3 |P4 | |
+---+---+---+---+---+ |       +---+---+---+---+---+ |
|P1p|P2p|   |P1q|   | |       |F2 |F0 |   |F3 |   | |
+---+---+---+---+---+ |       +---+---+---+---+---+ |
  |   |   |   |   |   |          |   |   |   |   |
 P1  P2  x   P1  x   |          P0  P1  P2  P3  P4
(Process 1)          |        (Virtual Pages for P1)

Explanation

  1. Physical Memory Frames (PMF):

    • The PMF consists of physical memory slots, labeled F0 through F4.
    • Each frame (F0, F1, F2, F3, F4) can hold a page from any process.
    • P1p and P1q are pages from Process 1 (P1). Similarly, P2p is a page from Process 2 (P2). Empty frames are marked with blank spaces.

  2. Page Table for Process 1:

    • Maps virtual pages (P0 through P4) of Process 1 to physical frames.
    • For example, the page P1 of Process 1 (P1) is mapped to frame F2 in physical memory, denoted as (P1 -> F2).
    • Some pages of P1 might not be currently loaded into physical memory and are marked as blank in the table.

In this setup:

  • Physical Memory Frames (PMF):

    • This is where the actual data from processes is stored in the computer’s memory (RAM).
    • Each slot (F0, F1, F2, etc.) can hold one page from a process. For example, slot F0 is holding page P1p from Process 1.

  • Page Table for Process 1 (P1):

    • The Page Table keeps track of where each page of a process is stored in the PMF.
    • For instance, Process 1’s page P1 is stored in physical frame F2, and page P3 is in frame F3.

Remember, the pages of a single process don't have to be next to each other in PMF. They can be scattered, and the Page Table keeps track of where they are so the Operating System can manage and access them properly. This allows efficient usage of memory, sharing it among multiple processes.

Let me know if this helps or if you need further clarifications!