A Closed-Form Method for LRU Replacement under Generalized Power-Law Demand

Details A Closed-Form Method for LRU Replacement under Generalized Power-Law Demand A Closed-Form Method for LRU Replacement under Generalized Power-Law Demand

2007-05-14

arxiv.org/abs/0705.1970v1

Computer Science

Data Structures and Algorithms

Scientific paper

We consider the well known \emph{Least Recently Used} (LRU) replacement algorithm and analyze it under the independent reference model and generalized power-law demand. For this extensive family of demand distributions we derive a closed-form expression for the per object steady-state hit ratio. To the best of our knowledge, this is the first analytic derivation of the per object hit ratio of LRU that can be obtained in constant time without requiring laborious numeric computations or simulation. Since most applications of replacement algorithms include (at least) some scenarios under i.i.d. requests, our method has substantial practical value, especially when having to analyze multiple caches, where existing numeric methods and simulation become too time consuming.

Affiliated with

Also associated with

No associations

Rating

A Closed-Form Method for LRU Replacement under Generalized Power-Law Demand does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Closed-Form Method for LRU Replacement under Generalized Power-Law Demand, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Closed-Form Method for LRU Replacement under Generalized Power-Law Demand will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-366031