On the smoothness of paging algorithms

DOI10.1007/s00224-017-9813-6zbMath1390.68772arXiv1510.03362OpenAlexW2951962248MaRDI QIDQ1743122

Jan Reineke, Alejandro Salinger

Publication date: 12 April 2018

Published in: Theory of Computing Systems, Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.03362

zbMATH Keywords

online algorithmsreal-time systemssmoothnesspagingcaching

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)

Related Items (1)

On the smoothness of paging algorithms

Uses Software

• PrivateLR
• OnlineMin
• CacheAudit

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A strongly competitive randomized paging algorithm
• Competitive analysis of randomized paging algorithms
• On the smoothness of paging algorithms
• \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm
• Randomized Online Algorithms with High Probability Guarantees
• Smoothed analysis of algorithms
• Competitive paging algorithms
• Beyond Competitive Analysis
• Continuity analysis of programs
• Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm
• The Theory of Definite Automata
• Principles of Optimal Page Replacement
• Differential Privacy

This page was built for publication: On the smoothness of paging algorithms