Markov Paging
From MaRDI portal
Publication:4507377
DOI10.1137/S0097539794268042zbMath0966.68053MaRDI QIDQ4507377
Anna R. Karlin, Prabhakar Raghavan, Steven J. Phillips
Publication date: 18 October 2000
Published in: SIAM Journal on Computing (Search for Journal in Brave)
68N25: Theory of operating systems
Related Items
Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis, Markov incremental constructions, Online Bounded Analysis, Online network design with outliers, Optimal eviction policies for stochastic address traces, On the separation and equivalence of paging strategies and other online algorithms, On the relative dominance of paging algorithms, A universal online caching algorithm based on pattern matching, The relative worst-order ratio applied to paging, Online-bounded analysis, Evaluating the quality of online optimization algorithms by discrete event simulation, Quantifying competitiveness in paging with locality of reference, Competitive caching of query results in search engines, Parameterized analysis of paging and list update algorithms, Data structures on event graphs, Relative interval analysis of paging algorithms on access graphs, Quantifying Competitiveness in Paging with Locality of Reference, Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison
