Competitive algorithms for server problems
From MaRDI portal
Publication:3485852
DOI10.1016/0196-6774(90)90003-WzbMath0705.68023WikidataQ63198876 ScholiaQ63198876MaRDI QIDQ3485852
No author found.
Publication date: 1990
Published in: Journal of Algorithms (Search for Journal in Brave)
68R10: Graph theory (including graph drawing) in computer science
90B35: Deterministic scheduling theory in operations research
68W10: Parallel algorithms in computer science
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
A Randomized Algorithm for Two Servers in Cross Polytope Spaces, ON THE k-TRUCK SCHEDULING PROBLEM, Dynamic location problems with limited look-ahead, Two online algorithms for the ambulance systems, On page migration and other relaxed task systems, Online paging and file caching with expiration times, A comparison of performance measures for online algorithms, Online computation with advice, A randomized algorithm for two servers in cross polytope spaces, SIMPLE: An optimal disk system with two restricted heads, Geometric two-server algorithms, Of robot ants and elephants: a computational comparison, A strongly competitive randomized paging algorithm, Online \(k\)-server routing problems, On multi-threaded metrical task systems, Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications, An on-line multi-CBR agent dispatching algorithm, On the remote server problem or more about TCP acknowledgments, On metric clustering to minimize the sum of radii, Online chasing problems for regular polygons, Randomized algorithm for the \(k\)-server problem on decomposable spaces, Randomized algorithms for metrical task systems, A note on the server problem and a benevolent adversary, HARMONIC is 3-competitive for two servers, Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and \(N\)-step SCAN, The online graph bandwidth problem, The weighted list update problem and the lazy adversary, The combinatorics of effective resistances and resistive inverses, Unfair problems and randomized algorithms for metrical task systems, On the power of randomization in on-line algorithms, On-line algorithms for locating checkpoints, A new measure for the study of on-line algorithms, On lookahead in the list update problem, Competitive randomized algorithms for nonuniform problems, A deterministic \(O(k^ 3)\)-competitive \(k\)-server algorithm for the circle, Lower bounds for on-line graph coloring, The list update problem and the retrieval of sets, A lower bound for two-server balancing algorithms, On-line algorithms for weighted bipartite matching and stable marriages, The 2-evader problem, Distributed near-optimal matching, Paging more than one page, More on randomized on-line algorithms for caching., More on weighted servers or FIFO is better than LRU., On the competitiveness of the move-to-front rule, Competitive analysis of randomized paging algorithms, On list update and work function algorithms., The 3-server problem in the plane., A randomized algorithm for two servers on the line., A general decomposition theorem for the \(k\)-server problem, The weighted 2-server problem, The CNN problem and other \(k\)-server variants, Paging with request sets, The orthogonal CNN problem, Competitive algorithms for the bicriteria \(k\)-server problem, Calculating lower bounds for caching problems, Ramsey-type theorems for metric spaces with applications to online problems, A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem, On Variants of File Caching, Randomized Competitive Analysis for Two-Server Problems, On the Additive Constant of the k-Server Work Function Algorithm
