Analysis of LRU cache trees with a power law reference distribution

DOI10.1007/978-3-319-44615-8_14zbMATH Open1398.68071OpenAlexW2513772652MaRDI QIDQ4690236FDOQ4690236

Authors: Udo R. Krieger, Natalia M. Markovich 

Publication date: 22 October 2018

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-44615-8_14

Recommendations

• LRU caching with moderately heavy request distributions
• Approximate analysis of LRU in the case of short term correlations
• Least-recently-used caching with dependent requests
• Optimizing LRU Caching for Variable Document Sizes
• The persistent-access-caching algorithm

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited In (8)

• Title not available (Why is that?)
• Critical sizing of LRU caches with dependent requests
• An analysis of optimum caching
• LRU caching with moderately heavy request distributions
• Transient and steady-state regime of a family of list-based cache replacement algorithms
• Comparing locality of reference -- some folk theorems for the miss rate and the output of caches
• Analysis of page replacement policies in the fluid limit
• Approximate analysis of LRU in the case of short term correlations

This page was built for publication: Analysis of LRU cache trees with a power law reference distribution

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