A strongly competitive randomized paging algorithm
From MaRDI portal
Publication:808246
Recommendations
Cites work
Cited in
(76)- Online file caching with rejection penalties
- Engineering efficient paging algorithms
- Object Caching for Queries and Updates
- New results on web caching with request reordering
- scientific article; zbMATH DE number 3949697 (Why is no real title available?)
- The worst page-replacement policy
- Online min-max paging
- Online paging with heterogeneous cache slots
- On variants of file caching
- Paging more than one page
- Exploiting symmetry for the job sequencing and tool switching problem
- Randomized online multi-threaded paging
- Competitive clustering of stochastic communication patterns on a ring
- Analysis of simple randomized buffer management for parallel I/O
- The complexity of paging against a probabilistic adversary
- Paging on a RAM with Limited Resources
- Randomized algorithm for the \(k\)-server problem on decomposable spaces
- A primal-dual randomized algorithm for weighted paging
- More on randomized on-line algorithms for caching.
- Dynamic balanced graph partitioning
- The relative worst-order ratio applied to paging
- Randomized on-line scheduling on two uniform machines
- Connection caching: Model and algorithms.
- The optimal structure of algorithms for \(\alpha\)-paging
- Scheduling multi-colour print jobs with sequence-dependent setup times
- A general decomposition theorem for the \(k\)-server problem
- Paging with connections: FIFO strikes again
- Competitive paging algorithms
- Combinatorial optimization models for production scheduling in automated manufacturing systems
- Memoryless algorithms for the generalized k-server problem on uniform metrics
- Combining request scheduling with web caching
- On competitive on-line paging with lookahead
- A better lower bound on the competitive ratio of the randomized 2-server problem
- The working set algorithm has competitive ratio less than two
- Ramsey-type theorems for metric spaces with applications to online problems
- Paging more than one page
- Competitive Algorithms for Generalized k -Server in Uniform Metrics
- Improved heuristic algorithms for the job sequencing and tool switching problem
- Competitive randomized algorithms for nonuniform problems
- Equitable Revisited
- The weighted 2-server problem
- Knowledge state algorithms
- Paging with request sets
- On-line multi-threaded paging
- \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm
- scientific article; zbMATH DE number 1875410 (Why is no real title available?)
- Outperforming LRU via competitive analysis on parametrized inputs for paging
- A proof of the optimality of the MIN paging algorithm using linear programming duality
- A primal-dual online algorithm for the \(k\)-server problem on weighted HSTs
- scientific article; zbMATH DE number 1256656 (Why is no real title available?)
- Scheduling with resource management in manufacturing systems
- OnlineMin: a fast strongly competitive randomized paging algorithm
- Competitive analysis of randomized paging algorithms
- The \(k\)-resource problem in uniform metric spaces
- Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost
- An \(O(\log k)\)-competitive algorithm for generalized caching
- scientific article; zbMATH DE number 65707 (Why is no real title available?)
- Competitive analysis of randomized paging algorithms
- Competitive algorithms for the weighted server problem
- Improved integer linear programming formulations for the job sequencing and tool switching problem
- On multi-threaded metrical task systems
- A new measure for the study of on-line algorithms
- scientific article; zbMATH DE number 1446755 (Why is no real title available?)
- Trackless online algorithms for the server problem
- Competitive \(k\)-server algorithms
- Improved space bounds for strongly competitive randomized paging algorithms
- Competitive caching of query results in search engines
- A randomized algorithm for two servers on the line.
- Online companion caching
- On randomization in on-line computation.
- Uniform multipaging reduces to paging
- On the power of randomization in on-line algorithms
- scientific article; zbMATH DE number 65703 (Why is no real title available?)
- Competitive on-line paging strategies for mobile users under delay constraints
- Markov Paging
- Limited bookmark randomized online algorithms for the paging problem
This page was built for publication: A strongly competitive randomized paging algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808246)
