Scribd Logo
Upload

Welcome to Scribd!

  • Floating Date: 5 December 2014 Submission Date: 13 December 2014 (Hard Deadline)

    Uploaded by

    vt121385
    8 views1 page
    This document contains an assignment with 5 questions related to paging and page replacement algorithms: 1. It asks how a segment could belong to two processes' address spaces and how an OS could allow access to memory not owned by a process. 2. Given a table with page information, it asks which page FIFO, LRU, and second chance would replace. 3. It asks how VAX/VMS handles page faults both when a requested page is and isn't in its free frame pool. 4. It asks when LFU would generate fewer faults than LRU and vice versa. 5. It asks when MFU would generate fewer faults than LRU and vice versa.

    Original Description:

    jjjjjjjjj

    Original Title

    Assignment 2

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains an assignment with 5 questions related to paging and page replacement algorithms: 1. It asks how a segment could belong to two processes' address spaces and how an OS could allow access to memory not owned by a process. 2. Given a table with page information, it asks which page FIFO, LRU, and second chance would replace. 3. It asks how VAX/VMS handles page faults both when a requested page is and isn't in its free frame pool. 4. It asks when LFU would generate fewer faults than LRU and vice versa. 5. It asks when MFU would generate fewer faults than LRU and vice versa.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    8 views1 page

    Floating Date: 5 December 2014 Submission Date: 13 December 2014 (Hard Deadline)

    Uploaded by

    vt121385
    This document contains an assignment with 5 questions related to paging and page replacement algorithms: 1. It asks how a segment could belong to two processes' address spaces and how an OS could allow access to memory not owned by a process. 2. Given a table with page information, it asks which page FIFO, LRU, and second chance would replace. 3. It asks how VAX/VMS handles page faults both when a requested page is and isn't in its free frame pool. 4. It asks when LFU would generate fewer faults than LRU and vice versa. 5. It asks when MFU would generate fewer faults than LRU and vice versa.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    of 1

    Floating date: 5 December 2014

    Submission date: 13 December 2014(hard deadline)


    Assignment-2
    1. Describe a mechanism by which one segment could belong to the address space of two
    different processes. Or On a system with paging, a process cannot access memory that it
    does not own; why? How could the operating system allow access to other memory?
    Why should it or should it not?

    2. Given a system with four page frames, the following table indicates page, load
    time, last reference time, dirty bit, and reference bit.
    Page
    0
    1
    2
    3

    Load time
    167
    321
    254
    154

    Last reference
    374
    321
    306
    331

    Dirty Bit
    1
    0
    1
    0

    Reference
    1
    0
    0
    1

    (a) Which page will FIFO replace?


    (b) Which page will LRU replace?
    (c) Which page will second chance replace?
    3. The VAX/VMS system uses a FIFO replacement algorithm for resident pages and a freeframe pool of recently used pages. Assume that the free-frame pool is managed using the
    least recently used replacement policy. Answer the following questions:
    a. If a page fault occurs and if the page does not exist in the free frame pool, how is
    free space generated for the newly requested page?
    b. If a page fault occurs and if the page exists in the free-frame pool, how is the
    resident page set and the free-frame pool managed to make space for the requested
    page?
    c. What does the system degenerate to if the number of resident pages is set to one?
    d. What does the system degenerate to if the number of pages in the free-frame pool
    is zero?
    4. Discuss situations under which the least frequently used page replacement algorithm
    generates fewer page faults than the least recently used page-replacement algorithm. Also
    discuss under what circumstance the opposite holds.
    5. Discuss situations under which the most frequently used page replacement algorithm
    generates fewer page faults than the least recently used page-replacement algorithm. Also
    discuss under what circumstance the opposite holds.
    Note: kindly sign the assignment sheet on submission

    You might also like