{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T14:34:51Z","timestamp":1775745291012,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":65,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,30]],"date-time":"2020-07-30T00:00:00Z","timestamp":1596067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1700521,2007733"],"award-info":[{"award-number":["1700521,2007733"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,30]]},"DOI":"10.1145\/3387514.3405883","type":"proceedings-article","created":{"date-parts":[[2020,7,30]],"date-time":"2020-07-30T22:35:31Z","timestamp":1596148531000},"page":"495-513","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":39,"title":["Caching with Delayed Hits"],"prefix":"10.1145","author":[{"given":"Nirav","family":"Atre","sequence":"first","affiliation":[{"name":"Carnegie Mellon University"}]},{"given":"Justine","family":"Sherry","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}]},{"given":"Weina","family":"Wang","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}]},{"given":"Daniel S.","family":"Berger","sequence":"additional","affiliation":[{"name":"Microsoft Research"}]}],"member":"320","published-online":{"date-parts":[[2020,7,30]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ReConFig.2010.61"},{"key":"e_1_3_2_2_2_1","volume-title":"Network Flows: Theory, Algorithms, and Applications. Prentice hall","author":"Ahuja Ravindra K","year":"1993","unstructured":"Ravindra K Ahuja , Thomas L Magnanti , and James B Orlin . Network Flows: Theory, Algorithms, and Applications. Prentice hall , 1993 . Ravindra K Ahuja, Thomas L Magnanti, and James B Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice hall, 1993."},{"key":"e_1_3_2_2_3_1","first-page":"31","volume-title":"SODA","author":"Albers Susanne","year":"1999","unstructured":"Susanne Albers , Sanjeev Arora , and Sanjeev Khanna . Page replacement for general caching problems . In SODA , pages 31 -- 40 , 1999 . Susanne Albers, Sanjeev Arora, and Sanjeev Khanna. Page replacement for general caching problems. In SODA, pages 31--40, 1999."},{"key":"e_1_3_2_2_4_1","volume-title":"Packt Publishing Ltd","author":"Anggoro Wisnu","year":"2015","unstructured":"Wisnu Anggoro and John Torjo . Boost. Asio C++ Network Programming . Packt Publishing Ltd , 2015 . Wisnu Anggoro and John Torjo. Boost. Asio C++ Network Programming. Packt Publishing Ltd, 2015."},{"key":"e_1_3_2_2_5_1","first-page":"1","volume-title":"USENIX NSDI.","author":"Beckmann Nathan","year":"2018","unstructured":"Nathan Beckmann , Haoxian Chen , and Asaf Cidon . Lhd : Improving hit rate by maximizing hit density . In USENIX NSDI. , pages 1 -- 14 , 2018 . Nathan Beckmann, Haoxian Chen, and Asaf Cidon. Lhd: Improving hit rate by maximizing hit density. In USENIX NSDI., pages 1--14, 2018."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976021.1"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1147\/sj.52.0078"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/381718.381727"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3286062.3286082"},{"issue":"2","key":"e_1_3_2_2_10_1","first-page":"32","article-title":"Practical bounds on optimal caching with variable object sizes","volume":"2","author":"Berger Daniel S.","year":"2018","unstructured":"Daniel S. Berger , Nathan Beckmann , and Mor Harchol-Balter . Practical bounds on optimal caching with variable object sizes . ACM POMACS , 2 ( 2 ): 32 , 2018 . Daniel S. Berger, Nathan Beckmann, and Mor Harchol-Balter. Practical bounds on optimal caching with variable object sizes. ACM POMACS, 2(2):32, 2018.","journal-title":"ACM POMACS"},{"key":"e_1_3_2_2_11_1","first-page":"195","volume-title":"USENIX OSDI","author":"Berger Daniel S","year":"2018","unstructured":"Daniel S Berger , Benjamin Berg , Timothy Zhu , Siddhartha Sen , and Mor Harchol-Balter . Robinhood : Tail latency aware caching-dynamic reallocation from cache-rich to cache-poor . In USENIX OSDI , pages 195 -- 212 , 2018 . Daniel S Berger, Benjamin Berg, Timothy Zhu, Siddhartha Sen, and Mor Harchol-Balter. Robinhood: Tail latency aware caching-dynamic reallocation from cache-rich to cache-poor. In USENIX OSDI, pages 195--212, 2018."},{"key":"e_1_3_2_2_12_1","first-page":"483","volume-title":"USENIX NSDI","author":"Berger Daniel S.","year":"2017","unstructured":"Daniel S. Berger , Ramesh Sitaraman , and Mor Harchol-Balter . Adaptsize : Orchestrating the hot object memory cache in a cdn . In USENIX NSDI , pages 483 -- 498 , March 2017 . Daniel S. Berger, Ramesh Sitaraman, and Mor Harchol-Balter. Adaptsize: Orchestrating the hot object memory cache in a cdn. In USENIX NSDI, pages 483--498, March 2017."},{"key":"e_1_3_2_2_13_1","first-page":"499","volume-title":"USENIX ATC","author":"Blankstein Aaron","year":"2017","unstructured":"Aaron Blankstein , Siddhartha Sen , and Michael J Freedman . Hyperbolic caching : Flexible caching for web applications . In USENIX ATC , pages 499 -- 511 , 2017 . Aaron Blankstein, Siddhartha Sen, and Michael J Freedman. Hyperbolic caching: Flexible caching for web applications. In USENIX ATC, pages 499--511, 2017."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000024"},{"key":"e_1_3_2_2_15_1","first-page":"193","volume-title":"Usenix symposium on internet technologies and systems","volume":"12","author":"Cao Pei","year":"1997","unstructured":"Pei Cao and Sandy Irani . Cost-aware www proxy caching algorithms . In Usenix symposium on internet technologies and systems , volume 12 , pages 193 -- 206 , 1997 . Pei Cao and Sandy Irani. Cost-aware www proxy caching algorithms. In Usenix symposium on internet technologies and systems, volume 12, pages 193--206, 1997."},{"key":"e_1_3_2_2_16_1","first-page":"379","volume-title":"USENIX ATC","author":"Cheng Yue","year":"2016","unstructured":"Yue Cheng , Fred Douglis , Philip Shilane , Grant Wallace , Peter Desnoyers , and Kai Li. Erasing belady's limitations : In search of flash cache offline optimality . In USENIX ATC , pages 379 -- 392 , 2016 . Yue Cheng, Fred Douglis, Philip Shilane, Grant Wallace, Peter Desnoyers, and Kai Li. Erasing belady's limitations: In search of flash cache offline optimality. In USENIX ATC, pages 379--392, 2016."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/0404017"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/3118246.3118620"},{"key":"e_1_3_2_2_19_1","unstructured":"Jeff Dean and R. Colin Scott. Numbers every programmer should know. https:\/\/people.eecs.berkeley.edu\/ rcs\/research\/interactive_latency.html.  Jeff Dean and R. Colin Scott. Numbers every programmer should know. https:\/\/people.eecs.berkeley.edu\/ rcs\/research\/interactive_latency.html."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/4236.806998"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2002.1036038"},{"key":"e_1_3_2_2_22_1","first-page":"371","volume-title":"USENIX NSDI","author":"Fan Bin","year":"2013","unstructured":"Bin Fan , David G Andersen , and Michael Kaminsky . Memc3 : Compact and concurrent memcache with dumber caching and smarter hashing . In USENIX NSDI , pages 371 -- 384 , 2013 . Bin Fan, David G Andersen, and Michael Kaminsky. Memc3: Compact and concurrent memcache with dumber caching and smarter hashing. In USENIX NSDI, pages 371--384, 2013."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.749258"},{"key":"e_1_3_2_2_24_1","first-page":"51","volume-title":"USENIX NSDI","author":"Firestone Daniel","year":"2018","unstructured":"Daniel Firestone , Andrew Putnam , Sambhrama Mundkur , Derek Chiou , Alireza Dabagh , Mike Andrewartha , Hari Angepat , Vivek Bhanu , Adrian Caulfield , Eric Chung , Azure accelerated networking: Smartnics in the public cloud . In USENIX NSDI , pages 51 -- 66 , 2018 . Daniel Firestone, Andrew Putnam, Sambhrama Mundkur, Derek Chiou, Alireza Dabagh, Mike Andrewartha, Hari Angepat, Vivek Bhanu, Adrian Caulfield, Eric Chung, et al. Azure accelerated networking: Smartnics in the public cloud. In USENIX NSDI, pages 51--66, 2018."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.70783"},{"key":"e_1_3_2_2_26_1","volume-title":"Burstiness and memory in complex systems. EPL (Europhysics Letters), 81(4):48002, jan","author":"Goh K.-I.","year":"2008","unstructured":"K.-I. Goh and A.-L. Barab\u00e1si . Burstiness and memory in complex systems. EPL (Europhysics Letters), 81(4):48002, jan 2008 . K.-I. Goh and A.-L. Barab\u00e1si. Burstiness and memory in complex systems. EPL (Europhysics Letters), 81(4):48002, jan 2008."},{"key":"e_1_3_2_2_27_1","volume-title":"Computer architecture: a quantitative approach","author":"Hennessy John L","year":"2011","unstructured":"John L Hennessy and David A Patterson . Computer architecture: a quantitative approach . Elsevier , 4 edition, 2011 . John L Hennessy and David A Patterson. Computer architecture: a quantitative approach. Elsevier, 4 edition, 2011."},{"key":"e_1_3_2_2_28_1","volume-title":"Microsoft production server traces","author":"SNIA","year":"2011","unstructured":"SNIA IOTTA. Microsoft production server traces , 2011 . SNIA IOTTA. Microsoft production server traces, 2011."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2016.17"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2006.50"},{"key":"e_1_3_2_2_31_1","first-page":"254","volume-title":"IEEE ICDCS","author":"Jin Shudong","year":"2000","unstructured":"Shudong Jin and Azer Bestavros . Popularity-aware greedy dual-size web proxy caching algorithms . In IEEE ICDCS , pages 254 -- 261 , 2000 . Shudong Jin and Azer Bestavros. Popularity-aware greedy dual-size web proxy caching algorithms. In IEEE ICDCS, pages 254--261, 2000."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(00)00312-1"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3286062.3286063"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1644893.1644917"},{"key":"e_1_3_2_2_35_1","first-page":"81","volume-title":"Lockup-free instruction fetch\/prefetch cache organization","author":"Kroft David","year":"1981","unstructured":"David Kroft . Lockup-free instruction fetch\/prefetch cache organization . In ACM\/IEEE ISCA, page 81 -- 87 , Washington, DC, USA, 1981 . IEEE Computer Society Press . David Kroft. Lockup-free instruction fetch\/prefetch cache organization. In ACM\/IEEE ISCA, page 81--87, Washington, DC, USA, 1981. IEEE Computer Society Press."},{"key":"e_1_3_2_2_36_1","first-page":"1","volume-title":"EUROSYS","author":"Li Conglong","year":"2015","unstructured":"Conglong Li and Alan L Cox . Gd-wheel : a cost-aware replacement policy for key-value stores . In EUROSYS , pages 1 -- 15 , 2015 . Conglong Li and Alan L Cox. Gd-wheel: a cost-aware replacement policy for key-value stores. In EUROSYS, pages 1--15, 2015."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3240302.3240315"},{"key":"e_1_3_2_2_38_1","first-page":"1","volume-title":"IEEE INFOCOM","author":"Li Suoheng","year":"2016","unstructured":"Suoheng Li , Jie Xu , Mihaela van der Schaar, and Weiping Li. Popularity-driven content caching . In IEEE INFOCOM , pages 1 -- 9 , 2016 . Suoheng Li, Jie Xu, Mihaela van der Schaar, and Weiping Li. Popularity-driven content caching. In IEEE INFOCOM, pages 1--9, 2016."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75142-7_29"},{"key":"e_1_3_2_2_40_1","volume-title":"Lower Bounds for Caching with Delayed Hits. arXiv:2006.00376 [cs.DS]","author":"Manohar Peter","year":"2020","unstructured":"Peter Manohar and Jalani Williams . Lower Bounds for Caching with Delayed Hits. arXiv:2006.00376 [cs.DS] , 2020 . Peter Manohar and Jalani Williams. Lower Bounds for Caching with Delayed Hits. arXiv:2006.00376 [cs.DS], 2020."},{"key":"e_1_3_2_2_41_1","first-page":"115","volume-title":"USENIX FAST","author":"Megiddo Nimrod","year":"2003","unstructured":"Nimrod Megiddo and Dharmendra S Modha . Arc : A self-tuning, low overhead replacement cache . In USENIX FAST , pages 115 -- 130 , 2003 . Nimrod Megiddo and Dharmendra S Modha. Arc: A self-tuning, low overhead replacement cache. In USENIX FAST, pages 115--130, 2003."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787475"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISPA.2008.100"},{"key":"e_1_3_2_2_44_1","volume-title":"USENIX NSDI","author":"Netravali Ravi","year":"2016","unstructured":"Ravi Netravali , Ameesh Goyal , James Mickens , and Hari Balakrishnan . Polaris : Faster page loads using fine-grained dependency tracking . In USENIX NSDI , March 2016 . Ravi Netravali, Ameesh Goyal, James Mickens, and Hari Balakrishnan. Polaris: Faster page loads using fine-grained dependency tracking. In USENIX NSDI, March 2016."},{"key":"e_1_3_2_2_45_1","unstructured":"Gurobi Optimization. Inc. \"gurobi optimizer reference manual \" 2015 2014.  Gurobi Optimization. Inc. \"gurobi optimizer reference manual \" 2015 2014."},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(99)00112-7"},{"key":"e_1_3_2_2_47_1","first-page":"117","volume-title":"USENIX NSDI","author":"Pfaff Ben","year":"2015","unstructured":"Ben Pfaff , Justin Pettit , Teemu Koponen , Ethan Jackson , Andy Zhou , Jarno Rajahalme , Jesse Gross , Alex Wang , Joe Stringer , Pravin Shelar , The design and implementation of open vswitch . In USENIX NSDI , pages 117 -- 130 , 2015 . Ben Pfaff, Justin Pettit, Teemu Koponen, Ethan Jackson, Andy Zhou, Jarno Rajahalme, Jesse Gross, Alex Wang, Joe Stringer, Pravin Shelar, et al. The design and implementation of open vswitch. In USENIX NSDI, pages 117--130, 2015."},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/954339.954341"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2006.5"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579324"},{"key":"e_1_3_2_2_51_1","first-page":"401","volume-title":"USENIX OSDI","author":"Rashmi KV","year":"2016","unstructured":"KV Rashmi , Mosharaf Chowdhury , Jack Kosaian , Ion Stoica , and Kannan Ramchandran . Ec-cache : Load-balanced, low-latency cluster caching with online erasure coding . In USENIX OSDI , pages 401 -- 417 , 2016 . KV Rashmi, Mosharaf Chowdhury, Jack Kosaian, Ion Stoica, and Kannan Ramchandran. Ec-cache: Load-balanced, low-latency cluster caching with online erasure coding. In USENIX OSDI, pages 401--417, 2016."},{"key":"e_1_3_2_2_52_1","volume-title":"The boost C++ libraries. Boris Sch\u00e4ling","author":"Sch\u00e4ling Boris","year":"2011","unstructured":"Boris Sch\u00e4ling . The boost C++ libraries. Boris Sch\u00e4ling , 2011 . Boris Sch\u00e4ling. The boost C++ libraries. Boris Sch\u00e4ling, 2011."},{"key":"e_1_3_2_2_53_1","volume-title":"A multiported nonblocking cache for a superscalar uniprocessor. Master's thesis","author":"Sicolo James Edward","year":"1992","unstructured":"James Edward Sicolo . A multiported nonblocking cache for a superscalar uniprocessor. Master's thesis , University of Illinois at Urbana-Champaign , 1992 . James Edward Sicolo. A multiported nonblocking cache for a superscalar uniprocessor. Master's thesis, University of Illinois at Urbana-Champaign, 1992."},{"key":"e_1_3_2_2_54_1","volume-title":"Operating system concepts","author":"Silberschatz Abraham","year":"2018","unstructured":"Abraham Silberschatz , Greg Gagne , and Peter B Galvin . Operating system concepts . Wiley , 2018 . Abraham Silberschatz, Greg Gagne, and Peter B Galvin. Operating system concepts. Wiley, 2018."},{"key":"e_1_3_2_2_55_1","volume-title":"USENIX NSDI","author":"Song Zhenyu","year":"2020","unstructured":"Zhenyu Song , Daniel S. Berger , and Lloyd Wyatt LI , Kai . Learning relaxed belady for content distribution network caching . In USENIX NSDI , 2020 . Zhenyu Song, Daniel S. Berger, and Lloyd Wyatt LI, Kai. Learning relaxed belady for content distribution network caching. In USENIX NSDI, 2020."},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492476"},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2006.44"},{"key":"e_1_3_2_2_59_1","volume-title":"The caida anonymized 2019 internet traces","author":"Walsworth Colby","year":"2019","unstructured":"Colby Walsworth , Emile Aben , K Claffy , and D Andersen . The caida anonymized 2019 internet traces , 2019 . Colby Walsworth, Emile Aben, K Claffy, and D Andersen. The caida anonymized 2019 internet traces, 2019."},{"key":"e_1_3_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/505696.505701"},{"key":"e_1_3_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/3305218.3305253"},{"key":"e_1_3_2_2_62_1","first-page":"307","volume-title":"USENIX OSDI","author":"Weil Sage A","year":"2006","unstructured":"Sage A Weil , Scott A Brandt , Ethan L Miller , Darrell DE Long , and Carlos Maltzahn . Ceph : A scalable, high-performance distributed file system . In USENIX OSDI , pages 307 -- 320 , 2006 . Sage A Weil, Scott A Brandt, Ethan L Miller, Darrell DE Long, and Carlos Maltzahn. Ceph: A scalable, high-performance distributed file system. In USENIX OSDI, pages 307--320, 2006."},{"key":"e_1_3_2_2_63_1","unstructured":"Wikipedia. Reverse proxy. https:\/\/en.wikipedia.org\/wiki\/Reverse_proxy.  Wikipedia. Reverse proxy. https:\/\/en.wikipedia.org\/wiki\/Reverse_proxy."},{"key":"e_1_3_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1965.264263"},{"key":"e_1_3_2_2_65_1","volume-title":"ACM SODA","author":"Young Neal E","year":"1991","unstructured":"Neal E Young . On-line caching as cache size varies . In ACM SODA , 1991 . Neal E Young. On-line caching as cache size varies. In ACM SODA, 1991."},{"key":"e_1_3_2_2_66_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0124-5"}],"event":{"name":"SIGCOMM '20: Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication","location":"Virtual Event USA","acronym":"SIGCOMM '20","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3387514.3405883","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3387514.3405883","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3387514.3405883","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:36Z","timestamp":1750200096000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3387514.3405883"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,30]]},"references-count":65,"alternative-id":["10.1145\/3387514.3405883","10.1145\/3387514"],"URL":"https:\/\/doi.org\/10.1145\/3387514.3405883","relation":{},"subject":[],"published":{"date-parts":[[2020,7,30]]},"assertion":[{"value":"2020-07-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}