Homework 8 Sarah Diesburg Operating Systems CS 3430

FIFO Memory page 1 2 3 R A R E F E A R F A R E R * A E

FIFO Memory page 1 2 3 R A R E F E A R F A R E R * F A E

FIFO Memory page 1 2 3 R A R E F E A R F A R E R * F A E *

FIFO Memory page 1 2 3 R A R E F E A R F A R E R * F A * E *

FIFO Memory page 1 2 3 R A R E F E A R F A R E R * F A * R E *

FIFO Memory page 1 2 3 R A R E F E A R F A R E R * F * A * R E *

FIFO Memory page 1 2 3 R A R E F E A R F A R E R * F * A * R E * A

FIFO Memory page 1 2 3 R A R E F E A R F A R E R * F * A * R E * * A

FIFO Memory page 1 2 3 R A R E F E A R F A R E R * F * A E * R E * * A

FIFO n 7 page faults Memory page 1 2 3 R A R E F E A R F A R E R * F * A E * R E * * A

FIFO 4 compulsory cache misses Memory page 1 2 3 R A R E F E A R F A R E R F * * A E * R E * * A

MIN Memory page 1 2 3 R A R E F E A R F A R E R * A E

MIN Memory page 1 2 3 R A R E F E A R F A R E R * F A E

MIN Memory page 1 2 3 R A R E F E A R F A R E R * F A E *

MIN Memory page 1 2 3 R A R E F E A R F A R E R * F A * E *

MIN Memory page 1 2 3 R A R E F E A R F A R E R * F A * E * R

MIN Memory page 1 2 3 R A R E F E A R F A R E R * F * A * E * R

MIN Memory page 1 2 3 R A R E F E A R F A R E R * F * A * E * * R

MIN Memory page 1 2 3 R A R E F E A R F A R E R * F * A * E * * R *

MIN Memory page 1 2 3 R A R E F E A R F A R E R * F * A * E * R *

MIN n 6 page faults Memory page 1 2 3 R A R E F E A R F A R E R * F * A * E * R *

LRU Memory page 1 2 3 R A R E F E A R F A R E R * A E

LRU Memory page 1 2 3 R A R E F E A R F A R E R * A F E

LRU Memory page 1 2 3 R A R E F E A R F A R E R * A F E *

LRU Memory page 1 2 3 R A R E F E A R F A R E R * A A F E *

LRU Memory page 1 2 3 R A R E F E A R F A R E R * A A F E R *

LRU Memory page 1 2 3 R A R E F E A R F A R E R * A A F E R * F

LRU Memory page 1 2 3 R A R E F E A R F A R E R * A A F E * R * F

LRU Memory page 1 2 3 R A R E F E A R F A R E R * A A F E * R * * F

LRU Memory page 1 2 3 R A R E F E A R F A R E R * A A F E * R * * F E

LRU n 7 page faults Memory page 1 2 3 R A R E F E A R F A R E R * A A F E * R * * F E

LFU Memory page 1 2 3 R A R E F E A R F A R E R 2 A F E

LFU Memory page 1 2 3 R A R E F E A R F A R E R 2 A F E 2

LFU Memory page 1 2 3 R A R E F E A R F A R E R 2 A F E A 2

LFU Memory page 1 2 3 R A R E F E A R F A R E R 2 3 A F E A 2

LFU Memory page 1 2 3 R A R E F E A R F A R E R 2 3 A F E A 2 F

LFU Memory page 1 2 3 R A R E F E A R F A R E R 2 3 A F E A 2 F A

LFU Memory page 1 2 3 R A R E F E A R F A R E R 2 3 A F E A 2 4 F A

LFU Memory page 1 2 3 R A R E F E A R F A R E R 2 3 A F E A 2 4 F A 3

LFU n 7 page faults Memory page 1 2 3 R A R E F E A R F A R E R 2 3 A F E A 2 4 F A 3

FIFO Disk Scheduling Policy n n Request queue: 10, 45, 52, 56, 70 Initial head position: 50 track 70 52 45 56 50 10 time

SSTF Disk Scheduling Policy n n Request queue: 10, 45, 52, 56, 70 Initial head position: 50 track 70 52 45 56 50 10 time

SCAN Disk Scheduling Policy n n Request queue: 10, 45, 52, 56, 70 Initial head position: 50 track 70 52 45 56 50 10 time

C-SCAN Disk Scheduling Policy n n Request queue: 10, 45, 52, 56, 70 Initial head position: 50 track 70 52 45 56 50 10 time

A Single Disk Platter With 5 Tracks fromto 0 1 2 3 4 0 0 1 2 3 4 1 1 0 1 2 3 2 2 1 0 1 2 3 3 2 1 0 1 4 4 3 2 1 0

A Single Disk Platter With 5 Tracks n 1/25 x (0 + 1 + 2 + 3 + 4) + + = = n 1/25 1/25 x x x (1 + 0 + 1 + 2 + 3) (2 + 1 + 0 + 1 + 2) (3 + 2 + 1 + 0 + 1) (4 + 3 + 2 + 1 + 0) (10 + 7 + 6 + 7 + 10) (20 + 14 + 6) = 40/25 = 1. 6 / 5 = 0. 32 ~= 1/3