Markov Paging
From MaRDI portal
Recommendations
Cited in
(23)- 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
- Relative interval analysis of paging algorithms on access graphs
- Online network design with outliers
- Quantifying competitiveness in paging with locality of reference
- Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison
- Transience des chaines de Markov lineaires sur les permutations
- Optimal eviction policies for stochastic address traces
- scientific article; zbMATH DE number 1256656 (Why is no real title available?)
- A New Method for Computing Page-Fault Rates
- LUMPABILITY IN LRU STACK WITH MARKOVIAN PAGE REFERENCES
- scientific article; zbMATH DE number 1893560 (Why is no real title available?)
- Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis
- Online bounded analysis
- Markov incremental constructions
- On the separation and equivalence of paging strategies and other online algorithms
- Lower bounds for several standard bin packing algorithms in the random order model
- On the relative dominance of paging algorithms
- A universal online caching algorithm based on pattern matching
- The relative worst-order ratio applied to paging
This page was built for publication: Markov Paging
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4507377)
