Competitive analysis of randomized paging algorithms
From MaRDI portal
Recommendations
Cites work
- A strongly competitive randomized paging algorithm
- An Optimal On-Line Algorithm for K Servers on Trees
- Competitive algorithms for server problems
- Competitive On-Line Algorithms for Distributed Data Management
- Competitive paging algorithms
- Competitive paging with locality of reference
- Generosity Helps or an 11-Competitive Algorithm for Three Servers
- scientific article; zbMATH DE number 1003270 (Why is no real title available?)
- scientific article; zbMATH DE number 432825 (Why is no real title available?)
- scientific article; zbMATH DE number 65707 (Why is no real title available?)
- scientific article; zbMATH DE number 1256656 (Why is no real title available?)
- scientific article; zbMATH DE number 742969 (Why is no real title available?)
- scientific article; zbMATH DE number 3078991 (Why is no real title available?)
- On the k -server conjecture
- On the k-server conjecture
- Page Migration Algorithms Using Work Functions
- Randomized algorithms for metrical task systems
Cited in
(62)- Competitive randomized algorithms for nonuniform problems
- On the influence of lookahead in competitive paging algorithms
- A unified analysis of paging and caching
- More on randomized on-line algorithms for caching.
- Limited bookmark randomized online algorithms for the paging problem
- A primal-dual online algorithm for the k-server problem on weighted HSTs
- The \(k\)-resource problem in uniform metric spaces
- On randomization in on-line computation.
- Online companion caching
- The weighted 2-server problem
- Memoryless algorithms for the generalized k-server problem on uniform metrics
- Randomized online computation with high probability guarantees
- The worst page-replacement policy
- Paging with request sets
- An adaptive probabilistic algorithm for online \(k\)-center clustering
- \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm
- Online file caching with rejection penalties
- Ramsey-type theorems for metric spaces with applications to online problems
- The complexity of paging against a probabilistic adversary
- Engineering efficient paging algorithms
- A better lower bound on the competitive ratio of the randomized 2-server problem
- The working set algorithm has competitive ratio less than two
- OnlineMin: a fast strongly competitive randomized paging algorithm
- On variants of file caching
- Paging on a RAM with Limited Resources
- Advice complexity and barely random algorithms
- Competitive analysis of flash memory algorithms
- Equitable Revisited
- Parameterized Analysis of Paging and List Update Algorithms
- KNOWLEDGE STATES FOR THE CACHING PROBLEM IN SHARED MEMORY MULTIPROCESSOR SYSTEMS
- Competitive paging algorithms
- scientific article; zbMATH DE number 65703 (Why is no real title available?)
- scientific article; zbMATH DE number 2080233 (Why is no real title available?)
- Markov Paging
- On-Line Paging Against Adversarially Biased Random Inputs
- scientific article; zbMATH DE number 1775453 (Why is no real title available?)
- The \(k\)-server problem
- Competitive analysis of randomized paging algorithms
- scientific article; zbMATH DE number 1875410 (Why is no real title available?)
- The optimal structure of algorithms for \(\alpha\)-paging
- New on-line algorithms for the page replication problem
- Dynamic balanced graph partitioning
- Advice complexity and barely random algorithms
- Measuring the problem-relevant information in input
- A primal-dual randomized algorithm for weighted paging
- A Randomized Algorithm for Two Servers in Cross Polytope Spaces
- Competitive Analysis of Flash-Memory Algorithms
- Knowledge state algorithms
- Outperforming LRU via competitive analysis on parametrized inputs for paging
- An \(O(\log k)\)-competitive algorithm for generalized caching
- New results on web caching with request reordering
- scientific article; zbMATH DE number 7758362 (Why is no real title available?)
- Competitive Algorithms for Generalized k -Server in Uniform Metrics
- A randomized algorithm for two servers in cross polytope spaces
- Online min-max paging
- Online paging with heterogeneous cache slots
- Distributional online weighted paging with limited horizon
- Competitive perimeter defense in linear environments
- A decomposition approach to the weighted k-server problem
- A strongly competitive randomized paging algorithm
- The relative worst-order ratio applied to paging
- Paging with connections: FIFO strikes again
This page was built for publication: Competitive analysis of randomized paging algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575677)
