A Closed-Form Method for LRU Replacement under Generalized Power-Law Demand
| dc.creator | Laoutaris, Nikolaos | |
| dc.date | 2007-05-14 | |
| dc.date.accessioned | 2026-07-07T08:01:27Z | |
| dc.date.available | 2026-07-07T08:01:27Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/0705.1970 | |
| dc.identifier | http://arxiv.org/abs/0705.1970 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/128914 | |
| dc.subject | Data Structures and Algorithms | |
| dc.title | A Closed-Form Method for LRU Replacement under Generalized Power-Law Demand | |
| dc.type | text |