Scribd Logo
Upload

Welcome to Scribd!

  • 5 views

    Virtual Memory Management Week 6-1

    Uploaded by

    atikahrahma
    This document discusses several topics related to virtual memory management. It first discusses simulating LRU in software using an aging algorithm. It then explains Belady's Anomaly using examples of FIFO page replacement with different numbers of page frames. The document also covers design issues such as local versus global allocation policies. Additionally, it discusses optimizing page size to minimize overhead due to page tables and internal fragmentation. Finally, it shows examples of using bit maps and linked lists for memory management and includes pseudocode for memory allocation algorithms.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Virtual Memory Management Week 6-1

    Uploaded by

    atikahrahma
    5 views11 pages
    This document discusses several topics related to virtual memory management. It first discusses simulating LRU in software using an aging algorithm. It then explains Belady's Anomaly using examples of FIFO page replacement with different numbers of page frames. The document also covers design issues such as local versus global allocation policies. Additionally, it discusses optimizing page size to minimize overhead due to page tables and internal fragmentation. Finally, it shows examples of using bit maps and linked lists for memory management and includes pseudocode for memory allocation algorithms.

    Original Description:

    sistem operasi

    Original Title

    Sistem operasi

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document discusses several topics related to virtual memory management. It first discusses simulating LRU in software using an aging algorithm. It then explains Belady's Anomaly using examples of FIFO page replacement with different numbers of page frames. The document also covers design issues such as local versus global allocation policies. Additionally, it discusses optimizing page size to minimize overhead due to page tables and internal fragmentation. Finally, it shows examples of using bit maps and linked lists for memory management and includes pseudocode for memory allocation algorithms.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pptx, pdf, or txt
    5 views11 pages

    Virtual Memory Management Week 6-1

    Uploaded by

    atikahrahma
    This document discusses several topics related to virtual memory management. It first discusses simulating LRU in software using an aging algorithm. It then explains Belady's Anomaly using examples of FIFO page replacement with different numbers of page frames. The document also covers design issues such as local versus global allocation policies. Additionally, it discusses optimizing page size to minimize overhead due to page tables and internal fragmentation. Finally, it shows examples of using bit maps and linked lists for memory management and includes pseudocode for memory allocation algorithms.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pptx, pdf, or txt
    of 11

    Virtual Memory Management

    Week 6-1

    Simulating LRU in Software(1)

    LRU using a matrix pages referenced in order


    0,1,2,3,2,1,0,3,2,3
    Bina Nusantara University

    Simulating LRU in Software(2)

    The aging algorithm simulates LRU in


    software
    Note
    Bina Nusantara
    University6 pages for 5 clock ticks, (a) (e)

    Modeling Page Replacement Algorithms


    Belady's Anomaly

    FIFO with 3 page frames


    FIFO with 4 page frames
    P's show which page references show page faults
    Bina Nusantara University

    Design Issues(1)
    Local versus Global Allocation Policies (1)

    Bina Nusantara University

    Original configuration
    Local page replacement
    Global page replacement

    Page Size(2)
    Overhead due to page table and internal fragmentation

    Where

    page table space

    s e p
    overhead

    p
    2

    s = average process size in bytes


    p = page size in bytes
    e = page entry

    internal
    fragmentation

    Optimized when

    p 2 se
    Bina Nusantara University

    Subject

    : T0316 Operating System

    Memory Management
    Week 5 - 2

    Memory Management with bit map

    Part of memory with 5 processes, 3 holes


    tick marks show allocation units
    shaded regions are free

    Corresponding bit map


    Same information as a list
    Bina Nusantara University

    Memory Management with linked


    list

    Bina Nusantara University

    Memory Allocation Algorithm

    Source: W. Stallings:Operating Systems: Internals and Design Principles

    Bina Nusantara University

    10

    Memory Allocation Algorithm

    Source: W. Stallings:Operating Systems: Internals and Design Principles


    Source: W. Stallings:Operating Systems: Internals and Design Principles

    Bina Nusantara University

    11

    You might also like