Competitive paging algorithms
From MaRDI portal
Publication:3988829
DOI10.1016/0196-6774(91)90041-VzbMath0753.68018MaRDI QIDQ3988829
No author found.
Publication date: 28 June 1992
Published in: Journal of Algorithms (Search for Journal in Brave)
68W10: Parallel algorithms in computer science
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68N25: Theory of operating systems
Related Items
Measuring the problem-relevant information in input, On Certain New Models for Paging with Locality of Reference, A strongly competitive randomized paging algorithm, The relative worst-order ratio applied to paging, Paging with connections: FIFO strikes again, 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, 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, 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, The worst page-replacement policy, Paging with request sets, Analysis of simple randomized buffer management for parallel I/O, Ramsey-type theorems for metric spaces with applications to online problems, Randomized Competitive Analysis for Two-Server Problems, Competitive Algorithms for Layered Graph Traversal
