Scribd Logo
Upload

Welcome to Scribd!

  • Lec 29 IPadNotes

    Uploaded by

    Abhay Mandal
    5 views9 pages
    The document discusses different page replacement algorithms: 1. FIFO (First In First Out) replaces the oldest page, which was first loaded into memory. This can lead to many page faults. 2. Optimal page replacement would replace the page not used for the longest time in the future. But this is impossible to implement as it requires knowledge of the future. 3. LRU (Least Recently Used) replaces the page that was used longest ago. This is easier to implement than optimal but can still result in many page faults.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses different page replacement algorithms: 1. FIFO (First In First Out) replaces the oldest page, which was first loaded into memory. This can lead to many page faults. 2. Optimal page replacement would replace the page not used for the longest time in the future. But this is impossible to implement as it requires knowledge of the future. 3. LRU (Least Recently Used) replaces the page that was used longest ago. This is easier to implement than optimal but can still result in many page faults.

    Copyright:

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

    Lec 29 IPadNotes

    Uploaded by

    Abhay Mandal
    The document discusses different page replacement algorithms: 1. FIFO (First In First Out) replaces the oldest page, which was first loaded into memory. This can lead to many page faults. 2. Optimal page replacement would replace the page not used for the longest time in the future. But this is impossible to implement as it requires knowledge of the future. 3. LRU (Least Recently Used) replaces the page that was used longest ago. This is easier to implement than optimal but can still result in many page faults.

    Copyright:

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

    Lec -29

    Page replacement algo


    '
    s -

    Page._fanlts ?_?

    Page fault service


    -
    Tim
    F¥¥¥E÷¥⑤
    ① F ↳

    → Ref
    Y↳
    7- 0 I 2 ⑥ 3 0 4 2 3 0 32 I 2 0 I 7 0 I

    *
    ④ ⑤ ⑤ D:
    A 2 3 4 56 7- 8 9 10 11 12 13 1415

    FIFO → 15 page fonts .

    -
    ?⃝?⃝?⃝
    ?⃝
    ?⃝?⃝
    Normalcy 1- a

    :*

    frames
    .
    Bdady 's anomaly in
    FIFO
    Ref : I 2 3 4 1 25 7 23 45
    2 → 12

    3 → 9
    ↑ 4 10
    ii. = →

    5 → 5
    12

    •\•
    -

    to -

    6 5

    nop%gah 1-
    ÷÷E:±
    .
    . • -

    no .
    of from ,
    ② Optimal Page Replacement
    -

    Best
    →
    → pg faults minimus
    .

    → almost
    impossible to implant .

    eg .

    7 0 I 2 0 3 0
    ① 2 3 0 3 2 1 20 17-01

    ⑦⑤ ±¥ :D
    . ⑤
    6
    I 23 4 5 7- 8
    9
    OPR→ qpagefadb
    =
    ?⃝?⃝
    ?⃝
    ③ LIU least -
    Reienty used .

    → apprommahnptbased.com#
    →
    a
    7 0 I 2 0 3 04 23 0 3 2 1 20 1 7 01

    D- ⑦ ⑤ 0:O:O: ④ ⑦
    I 23 4 5 6 78 9
    10 11 12

    LRU → 12ps -

    faults .
    ?⃝
    ?⃝?⃝?⃝
    LRU implant
    z =
    C

    ① Counter .

    0 I 2 0 3 0 4 2 3
    7-

    D- •
    COME → unreal

    so
    →

    cont } →

    Global shared
    •

    variable u
    7 ?

    Épkmt
    ?⃝?⃝
    ② stack based :

    →
    7 0 I 2 0 3 0 4 2 3 - -
    -

    D- ☒ ☒
    •
    ÷ > →

    1¥17 / ¥5.1 :
    0

    You might also like