A strongly competitive randomized paging algorithm
From MaRDI portal
Publication:808246
DOI10.1007/BF01759073zbMATH Open0731.68040OpenAlexW2083392624MaRDI QIDQ808246FDOQ808246
Authors: N. E. Zubov 
Publication date: 1991
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01759073
Recommendations
Cites Work
Cited In (76)
- On the smoothness of paging algorithms
- OnlineMin: a fast strongly competitive randomized paging algorithm
- Improved space bounds for strongly competitive randomized paging algorithms
- Title not available (Why is that?)
- Competitive paging algorithms
- \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm
- A proof of the optimality of the MIN paging algorithm using linear programming duality
- Title not available (Why is that?)
- Ramsey-type theorems for metric spaces with applications to online problems
- Connection caching: Model and algorithms.
- Title not available (Why is that?)
- Knowledge state algorithms
- Paging with request sets
- Competitive caching of query results in search engines
- On-line multi-threaded paging
- On multi-threaded metrical task systems
- Equitable Revisited
- Online companion caching
- A better lower bound on the competitive ratio of the randomized 2-server problem
- The working set algorithm has competitive ratio less than two
- On the power of randomization in on-line algorithms
- On competitive on-line paging with lookahead
- Uniform multipaging reduces to paging
- More on randomized on-line algorithms for caching.
- The \(k\)-resource problem in uniform metric spaces
- Limited bookmark randomized online algorithms for the paging problem
- Title not available (Why is that?)
- Markov Paging
- Improved integer linear programming formulations for the job sequencing and tool switching problem
- Title not available (Why is that?)
- The relative worst-order ratio applied to paging
- Trackless online algorithms for the server problem
- Scheduling multi-colour print jobs with sequence-dependent setup times
- Paging with connections: FIFO strikes again
- Competitive Algorithms for Generalized k -Server in Uniform Metrics
- Competitive randomized algorithms for nonuniform problems
- Combining request scheduling with web caching
- Competitive analysis of randomized paging algorithms
- A new measure for the study of on-line algorithms
- Paging more than one page
- Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost
- Randomized on-line scheduling on two uniform machines
- Combinatorial optimization models for production scheduling in automated manufacturing systems
- Scheduling with resource management in manufacturing systems
- Competitive \(k\)-server algorithms
- Title not available (Why is that?)
- A primal-dual online algorithm for the \(k\)-server problem on weighted HSTs
- A randomized algorithm for two servers on the line.
- Competitive on-line paging strategies for mobile users under delay constraints
- Randomized algorithm for the \(k\)-server problem on decomposable spaces
- Improved heuristic algorithms for the job sequencing and tool switching problem
- The optimal structure of algorithms for \(\alpha\)-paging
- Title not available (Why is that?)
- A primal-dual randomized algorithm for weighted paging
- A general decomposition theorem for the \(k\)-server problem
- The weighted 2-server problem
- On randomization in on-line computation.
- Competitive algorithms for the weighted server problem
- Competitive clustering of stochastic communication patterns on a ring
- Exploiting symmetry for the job sequencing and tool switching problem
- Online file caching with rejection penalties
- The complexity of paging against a probabilistic adversary
- Memoryless algorithms for the generalized k-server problem on uniform metrics
- Randomized online multi-threaded paging
- Paging more than one page
- Dynamic Balanced Graph Partitioning
- On variants of file caching
- The worst page-replacement policy
- Analysis of simple randomized buffer management for parallel I/O
- Engineering efficient paging algorithms
- General caching is hard: even with small pages
- Title not available (Why is that?)
- Online paging with heterogeneous cache slots
- Paging on a RAM with Limited Resources
- New results on web caching with request reordering
- Object Caching for Queries and Updates
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)
