Welcome to OStack Knowledge Sharing Community for programmer and developer-Open, Learning and Share
Welcome To Ask or Share your Answers For Others

Categories

0 votes
1.2k views
in Technique[技术] by (71.8m points)

replace - When does FIFO win over LRU replacement algorithm?

I need a sequence of numbers when FIFO wins over LRU. Let's say under 15 numbers and number of pages are 3. I want FIFO to get fewer page faults than LRU. Is it possible?

question from:https://stackoverflow.com/questions/66047001/when-does-fifo-win-over-lru-replacement-algorithm

与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…
Welcome To Ask or Share your Answers For Others

1 Answer

0 votes
by (71.8m points)

For a three-page cache, the sequence 1, 2, 3, 1, 4, 2 will do the trick. Evolution of the caches:

FIFO    LRU
1       1
12      12
123     123 [three misses for both as the cache fills]
123     231 [LRU moves 1 to the back]
234     314
234     142 [LRU but not FIFO misses on 2]

与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…
Welcome to OStack Knowledge Sharing Community for programmer and developer-Open, Learning and Share
Click Here to Ask a Question

...