Competitive paging algorithms
From MaRDI portal
Recommendations
Cited in
(98)- Randomized algorithm for the \(k\)-server problem on decomposable spaces
- The weighted list update problem and the lazy adversary
- On competitive on-line paging with lookahead
- Paging against a distribution and IP networking
- On the power of randomization in on-line algorithms
- Randomized competitive algorithms for the list update problem
- Competitive randomized algorithms for nonuniform problems
- Competitive k-server algorithms
- Competitive algorithms for the weighted server problem
- On the influence of lookahead in competitive paging algorithms
- Paging more than one page
- More on randomized on-line algorithms for caching.
- Connection caching: Model and algorithms.
- On the competitiveness of the move-to-front rule
- Competitive analysis of randomized paging algorithms
- Trackless online algorithms for the server problem
- Randomized competitive analysis for two server problems
- 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.
- A general decomposition theorem for the k-server problem
- Online companion caching
- Combining request scheduling with web caching
- Competitive caching of query results in search engines
- A proof of the optimality of the MIN paging algorithm using linear programming duality
- Greedy -approximation algorithm for covering with arbitrary constraints and submodular cost
- Randomized online computation with high probability guarantees
- The work function algorithm for the paging problem
- Competitive clustering of stochastic communication patterns on a ring
- The worst page-replacement policy
- Paging with request sets
- \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm
- Online file caching with rejection penalties
- Parameterized analysis of paging and list update algorithms
- Analysis of simple randomized buffer management for parallel I/O
- Online metric tracking and smoothing
- Ramsey-type theorems for metric spaces with applications to online problems
- Engineering efficient paging algorithms
- The working set algorithm has competitive ratio less than two
- Uniform multipaging reduces to paging
- On variants of file caching
- Paging on a RAM with Limited Resources
- On the incomparability of cache algorithms in terms of timing leakage
- Graphs and algorithms in communication networks on seven league boots
- Mechanisms with monitoring for truthful RAM allocation
- Randomized Competitive Analysis for Two-Server Problems
- scientific article; zbMATH DE number 65707 (Why is no real title available?)
- Competitive Algorithms for Layered Graph Traversal
- Comparison and analysis of ten static heuristics-based Internet data replication techniques
- The \(k\)-server problem
- On competitive on-line paging with lookahead
- Competitive analysis of randomized paging algorithms
- scientific article; zbMATH DE number 742969 (Why is no real title available?)
- Strongly Competitive Algorithms for Paging with Locality of Reference
- scientific article; zbMATH DE number 1446755 (Why is no real title available?)
- Randomized online multi-threaded paging
- Page migration with limited local memory capacity
- scientific article; zbMATH DE number 7559165 (Why is no real title available?)
- Caching with time windows and delays
- Paging more than one page
- Dynamic balanced graph partitioning
- Online algorithms with advice: the tape model
- Measuring the problem-relevant information in input
- Improved space bounds for strongly competitive randomized paging algorithms
- On Certain New Models for Paging with Locality of Reference
- Knowledge state algorithms
- Outperforming LRU via competitive analysis on parametrized inputs for paging
- An \(O(\log k)\)-competitive algorithm for generalized caching
- Online \(k\)-taxi via double coverage and time-reverse primal-dual
- Managing multiple mobile resources
- Online \(k\)-taxi via double coverage and time-reverse primal-dual
- On-line multi-threaded paging
- New results on web caching with request reordering
- Breaking the 2-competitiveness barrier for two servers in a tree
- scientific article; zbMATH DE number 7758362 (Why is no real title available?)
- The k-Server Problem with Delays on the Uniform Metric Space
- Competitive Algorithms for Generalized k -Server in Uniform Metrics
- Online Metric Algorithms with Untrusted Predictions
- Parametrized Metrical Task Systems
- Expected linear round synchronization: the missing link for linear Byzantine SMR
- Competitive strategy for on-line leasing of depreciable equipment
- Competitive analysis of on-line disk scheduling
- Expected linear round synchronization: the missing link for linear Byzantine SMR
- Adversarial bandits with knapsacks
- Tight bounds for prefetching and buffer management algorithms for parallel I/O systems
- Online paging with heterogeneous cache slots
- Online algorithms for weighted paging with predictions
- Caching connections in matchings
- Nonlinear paging
- Paging and the address-translation problem
- Distributional online weighted paging with limited horizon
- Competitive ratio vs regret minimization: achieving the best of both worlds
- Online paging with a vanishing regret
- A decomposition approach to the weighted k-server problem
- A strongly competitive randomized paging algorithm
- A universal online caching algorithm based on pattern matching
- The relative worst-order ratio applied to paging
- Paging with connections: FIFO strikes again
This page was built for publication: Competitive paging algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3988829)
