Competitive algorithms for server problems
From MaRDI portal
Publication:3485852
DOI10.1016/0196-6774(90)90003-WzbMATH Open0705.68023OpenAlexW2082099352WikidataQ63198876 ScholiaQ63198876MaRDI QIDQ3485852FDOQ3485852
Authors:
Publication date: 1990
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(90)90003-w
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Parallel algorithms in computer science (68W10)
Cited In (only showing first 100 items - show all)
- On list update and work function algorithms.
- Title not available (Why is that?)
- Better Bounds for Online Line Chasing
- ON THE k-TRUCK SCHEDULING PROBLEM
- Online file caching with rejection penalties
- Online in-time service problem with minimal server assignment
- Memoryless algorithms for the generalized k-server problem on uniform metrics
- The online \(k\)-server problem with rejection
- Parametrized Metrical Task Systems
- Tight bounds for double coverage against weak adversaries
- Randomized online multi-threaded paging
- The combinatorics of effective resistances and resistive inverses
- Calculating lower bounds for caching problems
- Benchmarking online dispatch algorithms for emergency medical services
- Unfair problems and randomized algorithms for metrical task systems
- Online paging and file caching with expiration times
- Randomized online computation with high probability guarantees
- Randomized algorithms for metrical task systems
- The \(k\)-resource problem in uniform metric spaces
- Paging more than one page
- Chasing convex bodies optimally
- Breaking the 2-competitiveness barrier for two servers in a tree
- Approximation algorithms for clustering with dynamic points
- Title not available (Why is that?)
- The k-Server Problem with Delays on the Uniform Metric Space
- Competitive Algorithms for Generalized k -Server in Uniform Metrics
- Multi-Finger Binary Search Trees
- On variants of file caching
- On lookahead in the list update problem
- Managing multiple mobile resources
- A note on the server problem and a benevolent adversary
- A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem
- Serving requests with on-line routing
- A lower bound for two-server balancing algorithms
- Online server allocation in a server farm via benefit task systems
- Online facility assignment
- A primal-dual online algorithm for the \(k\)-server problem on weighted HSTs
- Constrained TSP and low-power computing
- Improved and deterministic online service with deadlines or delay
- An optimally-competitive algorithm for maximum online perfect bipartite matching with i.i.d. arrivals
- Two online algorithms for the ambulance systems
- Online paging with heterogeneous cache slots
- Limit theorems and structural properties of the cat-and-mouse Markov chain and its generalisations
- The list update problem and the retrieval of sets
- The online \(k\)-server problem with max-distance objective
- Title not available (Why is that?)
- Competitive algorithms for the bicriteria \(k\)-server problem
- The \(k\)-client problem
- Ramsey-type theorems for metric spaces with applications to online problems
- On-line algorithms for locating checkpoints
- A Randomized Algorithm for Two Servers in Cross Polytope Spaces
- Online \(k\)-server routing problems
- Online computation with advice
- Distributed near-optimal matching
- On the remote server problem or more about TCP acknowledgments
- Paging with request sets
- Online chasing problems for regular polygons
- Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications
- On multi-threaded metrical task systems
- Lower bounds for on-line graph coloring
- An on-line multi-CBR agent dispatching algorithm
- Dynamic location problems with limited look-ahead
- A better lower bound on the competitive ratio of the randomized 2-server problem
- The working set algorithm has competitive ratio less than two
- Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and \(N\)-step SCAN
- Randomized algorithms for metrical task systems
- On the power of randomization in on-line algorithms
- On-line algorithms for the dominating set problem
- On-line algorithms for weighted bipartite matching and stable marriages
- Of robot ants and elephants: a computational comparison
- Online Metric Algorithms with Untrusted Predictions
- Uniform multipaging reduces to paging
- A simple analysis of the harmonic algorithm for two servers
- More on randomized on-line algorithms for caching.
- The CNN problem and other \(k\)-server variants
- The weighted list update problem and the lazy adversary
- On the additive constant of the \(k\)-server work function algorithm
- A fast work function algorithm for solving the \(k\)-server problem
- A fast approximate implementation of the work function algorithm for solving the \(k\)-server problem
- A strongly competitive randomized paging algorithm
- The online graph bandwidth problem
- Randomized Competitive Analysis for Two-Server Problems
- The \(k\)-server problem
- Title not available (Why is that?)
- R-LINE: a better randomized 2-server algorithm on the line
- The minimum backlog problem
- Competitive randomized algorithms for nonuniform problems
- The 2-evader problem
- The orthogonal CNN problem
- HARMONIC is 3-competitive for two servers
- On the competitiveness of the move-to-front rule
- Competitive analysis of randomized paging algorithms
- A new measure for the study of on-line algorithms
- Paging more than one page
- A deterministic \(O(k^ 3)\)-competitive \(k\)-server algorithm for the circle
- More on weighted servers or FIFO is better than LRU.
- A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching
- Geometric two-server algorithms
- A competitive 2-server algorithm
- On the additive constant of the \(k\)-server work function algorithm
This page was built for publication: Competitive algorithms for server problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3485852)
