Modeling locality: A probabilistic analysis of LRU and FWF

DOI10.1007/978-3-540-30140-0_11MaRDI QIDQ5464570zbMATH OpenOpenAlexFDO

Authors Luca Becchetti

Publication date 18 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b100428

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Recommendations

• Quantifying competitiveness in paging with locality of reference
• Quantifying competitiveness in paging with locality of reference
• On paging with locality of reference
• Competitive paging with locality of reference
• scientific article; zbMATH DE number 1303543

Cited in

(17)

• Quantifying competitiveness in paging with locality of reference
• Parameterized analysis of paging and list update algorithms
• A Survey of Algorithms and Models for List Update
• Quantifying competitiveness in paging with locality of reference
• Average-Case Competitive Analyses for One-Way Trading
• Optimal eviction policies for stochastic address traces
• List update with probabilistic locality of reference
• On the Relative Dominance of Paging Algorithms
• Comparing locality of reference -- some folk theorems for the miss rate and the output of caches
• Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis
• List Update with Locality of Reference
• On paging with locality of reference
• Average-case competitive analyses for one-way trading
• On the separation and equivalence of paging strategies and other online algorithms
• New and improved bounds for Markov paging
• On the relative dominance of paging algorithms
• The relative worst-order ratio applied to paging

This page was built for publication: Modeling locality: A probabilistic analysis of LRU and FWF

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5464570)