On the separation and equivalence of paging strategies
From MaRDI portal
Publication:2934601
Recommendations
Cited in
(36)- scientific article; zbMATH DE number 7559116 (Why is no real title available?)
- scientific article; zbMATH DE number 7559165 (Why is no real title available?)
- Outperforming LRU via competitive analysis on parametrized inputs for paging
- Quantifying competitiveness in paging with locality of reference
- On list update with locality of reference
- scientific article; zbMATH DE number 1256656 (Why is no real title available?)
- Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis
- DesynchLRU: an efficient page replacement algorithm with desynchronized cache and RAM
- On Certain New Models for Paging with Locality of Reference
- List Update with Locality of Reference
- Online-bounded analysis
- Best-of-both-worlds analysis of online search
- Relative interval analysis of paging algorithms on access graphs
- On the absolute approximation ratio for first fit and related results
- Evaluating the quality of online optimization algorithms by discrete event simulation
- On-Line Paging Against Adversarially Biased Random Inputs
- A theoretical comparison of LRU and LRU-K
- On adequate performance measures for paging
- The worst page-replacement policy
- Online bounded analysis
- Parameterized analysis of paging and list update algorithms
- Relative Worst-Order Analysis: A Survey
- Quantifying competitiveness in paging with locality of reference
- List factoring and relative worst order analysis
- scientific article; zbMATH DE number 4201604 (Why is no real title available?)
- scientific article; zbMATH DE number 1755579 (Why is no real title available?)
- On the Relative Dominance of Paging Algorithms
- Paging and list update under bijective analysis
- The paging drum queue: A uniform perspective and further results
- On the relative dominance of paging algorithms
- A comparison of performance measures via online search
- A Survey of Algorithms and Models for List Update
- On the separation and equivalence of paging strategies and other online algorithms
- On multi-threaded Paging
- Optimal eviction policies for stochastic address traces
- A new variable-sized bin packing problem
This page was built for publication: On the separation and equivalence of paging strategies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934601)
