Transient and steady-state regime of a family of list-based cache replacement algorithms

DOI10.1007/S11134-016-9487-9zbMath1349.68038OpenAlexW2428932821MaRDI QIDQ335905

Benny Van Houdt, Nicolas Gast

Publication date: 10 November 2016

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/10067/1410110151162165141

zbMATH Keywords

self-organizing listscache replacement policiesindependent reference modelmiss ratiostorage management

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Information storage and retrieval of data (68P20)

Related Items (3)

Optimal timer-based caching policies for general arrival processes ⋮ Transient and steady-state regime of a family of list-based cache replacement algorithms ⋮ Mean-Field Limits Beyond Ordinary Differential Equations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Transient and steady-state regime of a family of list-based cache replacement algorithms
• Correlation inequalities on some partially ordered sets
• Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities
• Analysis of Page Replacement Policies in the Fluid Limit
• LRU is better than FIFO under the independent reference model
• Some Results on Distribution-Free Analysis of Paging Algorithms
• Efficient Calculation of Expected Miss Ratios in the Independent Reference Model
• Probabilistic methods for web caching
• A Unified Approach to the Evaluation of a Class of Replacement Algorithms
• Inequalities: theory of majorization and its applications

This page was built for publication: Transient and steady-state regime of a family of list-based cache replacement algorithms