Practical Bounds on Optimal Caching with Variable Object Sizes-Reference-Cited by-同舟云学术

Practical Bounds on Optimal Caching with Variable Object Sizes

Published:2018-06-12 Issue: Volume: Page:
ISSN:
Container-title:Abstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer Systems
language:
Short-container-title:

Author:

Berger Daniel S.¹,Beckmann Nathan¹,Harchol-Balter Mor¹

Affiliation:

1. Carnegie Mellon University, Pittsburgh, PA, USA

Funder

National Science Foundation

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3219617.3219627

Reference21 articles.

1. Marc Abrams C. R. Standridge Ghaleb Abdulla S. Williams and Edward A. Fox. 1995. Caching Proxies: Limitations and Potentials. Technical Report. Virginia Polytechnic Institute & State University Blacksburgh VA. Marc Abrams C. R. Standridge Ghaleb Abdulla S. Williams and Edward A. Fox. 1995. Caching Proxies: Limitations and Potentials. Technical Report. Virginia Polytechnic Institute & State University Blacksburgh VA.

2. Susanne Albers Sanjeev Arora and Sanjeev Khanna. 1999. Page replacement for general caching problems. In SODA. 31--40. Susanne Albers Sanjeev Arora and Sanjeev Khanna. 1999. Page replacement for general caching problems. In SODA. 31--40.

3. A unified approach to approximating resource allocation and scheduling

4. A study of replacement algorithms for a virtual-storage computer

5. Daniel S. Berger Nathan Beckmann and Mor Harchol-Balter. 2018. Practical Bounds on Optimal Caching with Variable Object Sizes. ACM POMACS (2018). To appear June 2018. 10.1145/3219617.3219627 Daniel S. Berger Nathan Beckmann and Mor Harchol-Balter. 2018. Practical Bounds on Optimal Caching with Variable Object Sizes. ACM POMACS (2018). To appear June 2018. 10.1145/3219617.3219627

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. To Cache or Not to Cache;Algorithms;2024-07-07

2. An Empirical Analysis on Memcached's Replacement Policies;Proceedings of the International Symposium on Memory Systems;2023-10-02

3. ARC-learning: A Self-tuning Cache Policy under Dynamic Popularity;2022 IEEE 8th International Conference on Computer and Communications (ICCC);2022-12-09

4. End-to-End Deep Learning Proactive Content Caching Framework;GLOBECOM 2022 - 2022 IEEE Global Communications Conference;2022-12-04

5. Revisiting Application Offloads on Programmable Switches;2022 IFIP Networking Conference (IFIP Networking);2022-06-13