Which is better lru or fifo

Algorithmica 23, — Download citation. Issue Date : February Anyone you share the following link with will be able to read this content:. Sorry, a shareable link is not currently available for this article. Provided by the Springer Nature SharedIt content-sharing initiative. Skip to main content. Search SpringerLink Search. But I cannot think of the initial problem statement solution. Any hints would really be great! Sign up to join this community. The best answers are voted up and rise to the top.

Stack Overflow for Teams — Collaborate and share knowledge with a private group. Create a free Team What is Teams? Learn more. Asked 2 years, 8 months ago. Active 6 months ago. Viewed 1k times. For example: 2,6,5, FIFO keeps the things that were most recently added. LRU is, in general, more efficient, because there are generally memory items that are added once and never used again, and there are items that are added and used frequently.

LRU is much more likely to keep the frequently-used items in memory. An Adaptive Replacement Cache is hybrid that adapts its strategy based on actual usage patterns. According to temporal locality of reference , memory that has been accessed recently is more likely to be accessed again soon.

Stack Overflow for Teams — Collaborate and share knowledge with a private group. Create a free Team What is Teams? Collectives on Stack Overflow. Learn more.

Ask Question. Asked 11 years, 10 months ago. Active 9 years, 9 months ago. Viewed 26k times. Improve this question. Is this "CS 4xx - Operating Systems" related? Add a comment. Active Oldest Votes. If that's not what you mean, please edit your question to give more details. Improve this answer. Jon Skeet Jon Skeet 1.