Transient and steady-state regime of a family of list-based cache replacement algorithms
type: Item
instance of: scholarly article
title: Transient and steady-state regime of a family of list-based cache replacement algorithms
zbMATH Open document ID: 1349.68038
author: Nicolas Gast
author: Benny Van Houdt
published in: Queueing Systems
publication date: 2016-11-10T00:00:00Z
full work available at URL: https://hdl.handle.net/10067/1410110151162165141
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68P20
Mathematics Subject Classification ID: 60J20
zbMATH DE Number: 6650193
zbMATH Keywords: cache replacement policies
zbMATH Keywords: independent reference model
zbMATH Keywords: storage management
zbMATH Keywords: self-organizing lists
zbMATH Keywords: miss ratio
MaRDI profile type: Publication
OpenAlex ID: W2428932821
cites work: Some Results on Distribution-Free Analysis of Paging Algorithms
cites work: Q4205064
cites work: Efficient Calculation of Expected Miss Ratios in the Independent Reference Model
cites work: Correlation inequalities on some partially ordered sets
cites work: A Unified Approach to the Evaluation of a Class of Replacement Algorithms
cites work: Analysis of Page Replacement Policies in the Fluid Limit
cites work: Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities
cites work: Q5668002
cites work: Q3917278
cites work: Inequalities: theory of majorization and its applications
cites work: Probabilistic methods for web caching
cites work: LRU is better than FIFO under the independent reference model
cites work: Q5395297
DOI: 10.1007/S11134-016-9487-9
description: scientific article; zbMATH DE number 6650193