Homework SourseGiven that main memory is composed of three page frames for
Given that main memory is composed of three page frames for public use and that a
program requests pages in the following order:
c c a b d c a b c a
Using either the LRU or FIFO page removal algorithm, do a page trace analysis indicating page faults with asterisks. Then compute the failure and success ratios.
Please note in your answer which page removal algorithm are you implementing.
Solution
FIFO (First-In-First-Out) page removal algorithm
page fault = 7
page success = 3
failure ratio = 7/10 = 0.7
success ratio = 3/10 = 0.3
| Request---> | c | c | a | b | d | c | a | b | c | a |
| page frame 0 | c | c | c | c | d | d | d | b | b | b |
| page frame 1 | a | a | a | c | c | c | c | c | ||
| page frame 2 | b | b | b | a | a | a | a | |||
| page faults | * | * | * | * | * | * | * |
