Document Open Access Logo

Efficient Caching with Reserves via Marking

Authors Sharat Ibrahimpur , Manish Purohit , Zoya Svitkina, Erik Vee, Joshua R. Wang

Thumbnail PDF


  • Filesize: 0.86 MB
  • 20 pages

Document Identifiers

Author Details

Sharat Ibrahimpur
  • Department of Mathematics, London School of Economics and Political Science, UK
Manish Purohit
  • Google Research, USA
Zoya Svitkina
  • Google Research, USA
Erik Vee
  • Google Research, USA
Joshua R. Wang
  • Google Research, USA

Cite AsGet BibTex

Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, and Joshua R. Wang. Efficient Caching with Reserves via Marking. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 261, pp. 80:1-80:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)


Online caching is among the most fundamental and well-studied problems in the area of online algorithms. Innovative algorithmic ideas and analysis - including potential functions and primal-dual techniques - give insight into this still-growing area. Here, we introduce a new analysis technique that first uses a potential function to upper bound the cost of an online algorithm and then pairs that with a new dual-fitting strategy to lower bound the cost of an offline optimal algorithm. We apply these techniques to the Caching with Reserves problem recently introduced by Ibrahimpur et al. [Ibrahimpur et al., 2022] and give an O(log k)-competitive fractional online algorithm via a marking strategy, where k denotes the size of the cache. We also design a new online rounding algorithm that runs in polynomial time to obtain an O(log k)-competitive randomized integral algorithm. Additionally, we provide a new, simple proof for randomized marking for the classical unweighted paging problem.

Subject Classification

ACM Subject Classification
  • Theory of computation → Caching and paging algorithms
  • Approximation Algorithms
  • Online Algorithms
  • Caching


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Dimitris Achlioptas, Marek Chrobak, and John Noga. Competitive Analysis of Randomized Paging Algorithms. Theoretical Computer Science, 234(1):203-218, 2000. URL:
  2. Anna Adamaszek, Artur Czumaj, Matthias Englert, and Harald Räcke. An O(log k)-Competitive Algorithm for Generalized Caching. ACM Transactions on Algorithms, 15(1):6:1-6:18, 2018. URL:
  3. Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, and Michele Scquizzato. Tight Bounds for Parallel Paging and Green Paging. In Proceedings of the 32nd Symposium on Discrete Algorithms, pages 3022-3041, 2021. URL:
  4. Nikhil Bansal, Niv Buchbinder, and Joseph Seffi Naor. A Simple Analysis for Randomized Online Weighted Paging. Unpublished Manuscript, 2010. Google Scholar
  5. Nikhil Bansal, Niv Buchbinder, and Joseph (Seffi) Naor. Towards the Randomized k-Server Conjecture: A Primal-Dual Approach: (Extended Abstract). In Proceedings of the 21st Symposium on Discrete Algorithms, pages 40-55, 2010. URL:
  6. Nikhil Bansal, Christian Coester, Ravi Kumar, Manish Purohit, and Erik Vee. Learning-Augmented Weighted Paging. In Proceedings of the 33rd Symposium on Discrete Algorithms, pages 67-89, 2022. URL:
  7. Jichuan Chang and Gurindar S Sohi. Cooperative Cache Partitioning for Chip Multiprocessors. In Proceedings of the 21st ACM International Conference on Supercomputing, pages 242-252, 2007. URL:
  8. Ashish Chiplunkar, Monika Henzinger, Sagar Sudhir Kale, and Maximilian Vötsch. Online Min-Max Paging. In Proceedings of the 34th Symposium on Discrete Algorithms, pages 1545-1565, 2023. URL:
  9. Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel D. Sleator, and Neal E. Young. Competitive Paging Algorithms. Journal of Algorithms, 12(4):685-699, 1991. URL:
  10. Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, and Joshua R. Wang. Caching with Reserves. In Proceedings of the 25th International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), volume 245, pages 52:1-52:16, 2022. URL:
  11. Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, and Joshua R. Wang. Efficient Caching with Reserves via Marking. CoRR, abs/2305.02508, 2023. URL:
  12. Wu Kan, Tu Kaiwei, Patel Yuvraj, Sen Rathijit, Park Kwanghyun, Arpaci-Dusseau Andrea, and Remzi Arpaci-Dusseau. NyxCache: Flexible and Efficient Multi-tenant Persistent Memory Caching. In Proceedings of the 20th USENIX Conference on File and Storage Technologies (FAST), pages 1-16, 2022. URL:
  13. Mayuresh Kunjir, Brandon Fain, Kamesh Munagala, and Shivnath Babu. ROBUS: Fair Cache Allocation for Data-parallel Workloads. In Proceedings of the 2017 ACM International Conference on Management of Data (SIGMOD), pages 219-234, 2017. URL:
  14. Lyle A. McGeoch and Daniel D. Sleator. A Strongly Competitive Randomized Paging Algorithm. Algorithmica, 6:816-825, 1991. URL:
  15. Qifan Pu, Haoyuan Li, Matei Zaharia, Ali Ghodsi, and Ion Stoica. FairRide: Near-Optimal, Fair Cache Sharing. In Proceedings of the 13th USENIX Symposium on Networked Systems Design and Implementation (NSDI), pages 393-406, 2016. URL:
  16. Harold S. Stone, John Turek, and Joel L. Wolf. Optimal Partitioning of Cache Memory. IEEE Transactions on Computers, 41(9):1054-1068, 1992. URL:
  17. G Edward Suh, Larry Rudolph, and Srinivas Devadas. Dynamic Partitioning of Shared Cache Memory. The Journal of Supercomputing, 28(1):7-26, 2004. URL:
  18. Yinghao Yu, Wei Wang, Jun Zhang, and Khaled Ben Letaief. LACS: Load-Aware Cache Sharing with Isolation Guarantee. In Proceedings of the 39th IEEE International Conference on Distributed Computing Systems (ICDCS), pages 207-217. IEEE, 2019. URL:
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail