Competitive paging with locality of reference
From MaRDI portal
Publication:1892219
DOI10.1006/jcss.1995.1021zbMath0827.68027OpenAlexW3197565351MaRDI QIDQ1892219
Sandy Irani, Allan Borodin, Baruch Schieber, Prabhakar Raghavan
Publication date: 8 June 1995
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.1995.1021
Related Items (50)
On list update with locality of reference ⋮ Online-bounded analysis ⋮ On the relative dominance of paging algorithms ⋮ Quantifying Competitiveness in Paging with Locality of Reference ⋮ Randomized online multi-threaded paging ⋮ Online Multi-Coloring with Advice ⋮ On multi-threaded metrical task systems ⋮ Strongly competitive algorithms for caching with pipelined prefetching ⋮ Measuring the problem-relevant information in input ⋮ Competitive distributed decision-making ⋮ Blocking for external graph searching ⋮ The relative worst-order ratio applied to paging ⋮ Optimal eviction policies for stochastic address traces ⋮ A theoretical comparison of LRU and LRU-K ⋮ Optimal Online Edge Coloring of Planar Graphs with Advice ⋮ Real-time integrated prefetching and caching ⋮ Relative Worst-Order Analysis: A Survey ⋮ Competitive ratio of list scheduling on uniform machines and randomized heuristics ⋮ On the Relative Dominance of Paging Algorithms ⋮ On the separation and equivalence of paging strategies and other online algorithms ⋮ Calculating lower bounds for caching problems ⋮ Online algorithms with advice: the tape model ⋮ Semi-online preemptive scheduling: one algorithm for all variants ⋮ Online Bounded Analysis ⋮ An experimental study of new and known online packet buffering algorithms ⋮ Least-recently-used caching with dependent requests ⋮ Integrated prefetching and caching in single and parallel disk systems ⋮ The worst page-replacement policy ⋮ Unnamed Item ⋮ On paging with locality of reference ⋮ Weighted online problems with advice ⋮ Approximating \(k\)-forest with resource augmentation: a primal-dual approach ⋮ Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis ⋮ On Certain New Models for Paging with Locality of Reference ⋮ Relative interval analysis of paging algorithms on access graphs ⋮ Quantifying competitiveness in paging with locality of reference ⋮ Managing multiple mobile resources ⋮ Engineering Efficient Paging Algorithms ⋮ On the competitiveness of the move-to-front rule ⋮ Competitive analysis of randomized paging algorithms ⋮ Topology matters: smoothed competitiveness of metrical task systems ⋮ A Survey of Algorithms and Models for List Update ⋮ Applying extra-resource analysis to load balancing. ⋮ Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities ⋮ Paging against a distribution and IP networking ⋮ Unnamed Item ⋮ Parameterized analysis of paging and list update algorithms ⋮ Trackless online algorithms for the server problem ⋮ Limited bookmark randomized online algorithms for the paging problem ⋮ Online multi-coloring with advice
This page was built for publication: Competitive paging with locality of reference
