On the separation and equivalence of paging strategies
From MaRDI portal
Publication:2934601
zbMATH Open1302.68327MaRDI QIDQ2934601FDOQ2934601
Authors: Spyros Angelopoulos, Reza Dorrigiv, Alejandro Lopez-Ortiz 
Publication date: 18 December 2014
Recommendations
Cited In (36)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Outperforming LRU via competitive analysis on parametrized inputs for paging
- Quantifying competitiveness in paging with locality of reference
- Title not available (Why is that?)
- On list update with locality of reference
- 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
- Best-of-both-worlds analysis of online search
- Online-bounded analysis
- 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
- Online bounded analysis
- The worst page-replacement policy
- Relative Worst-Order Analysis: A Survey
- Parameterized analysis of paging and list update algorithms
- Quantifying competitiveness in paging with locality of reference
- Title not available (Why is that?)
- List factoring and relative worst order analysis
- Title not available (Why is that?)
- On the Relative Dominance of Paging Algorithms
- Paging and list update under bijective analysis
- A comparison of performance measures via online search
- On the relative dominance of paging algorithms
- The paging drum queue: A uniform perspective and further results
- A Survey of Algorithms and Models for List Update
- On multi-threaded Paging
- On the separation and equivalence of paging strategies and other online algorithms
- A new variable-sized bin packing problem
- Optimal eviction policies for stochastic address traces
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)
