{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T16:14:38Z","timestamp":1772727278254,"version":"3.50.1"},"reference-count":24,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2018,4,3]],"date-time":"2018-04-03T00:00:00Z","timestamp":1522713600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Meas. Anal. Comput. Syst."],"published-print":{"date-parts":[[2018,4,3]]},"abstract":"<jats:p>Caching systems using the Least Recently Used (LRU) principle have now become ubiquitous. A fundamental question for these systems is whether the cache space should be pooled together or divided to serve multiple flows of data item requests in order to minimize the miss probabilities. In this paper, we show that there is no straight yes or no answer to this question, depending on complex combinations of critical factors, including, e.g., request rates, overlapped data items across different request flows, data item popularities and their sizes. To this end, we characterize the performance of multiple flows of data item requests under resource pooling and separation for LRU caching when the cache size is large.<\/jats:p>\n          <jats:p>Analytically, we show that it is asymptotically optimal to jointly serve multiple flows if their data item sizes and popularity distributions are similar and their arrival rates do not differ significantly; the self-organizing property of LRU caching automatically optimizes the resource allocation among them asymptotically. Otherwise, separating these flows could be better, e.g., when data sizes vary significantly. We also quantify critical points beyond which resource pooling is better than separation for each of the flows when the overlapped data items exceed certain levels. Technically, for a broad class of heavy-tailed distributions we derive the asymptotic miss probabilities of multiple flows of requests with varying data item sizes in a shared LRU cache space. It also validates the characteristic time approximation under certain conditions. These results provide new insights on improving the performance of caching systems.<\/jats:p>","DOI":"10.1145\/3179408","type":"journal-article","created":{"date-parts":[[2018,4,4]],"date-time":"2018-04-04T12:11:45Z","timestamp":1522843905000},"page":"1-31","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["On Resource Pooling and Separation for LRU Caching"],"prefix":"10.1145","volume":"2","author":[{"given":"Jian","family":"Tan","sequence":"first","affiliation":[{"name":"The Ohio State University, Columbus, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guocong","family":"Quan","sequence":"additional","affiliation":[{"name":"The Ohio State University, Columbus, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaiyi","family":"Ji","sequence":"additional","affiliation":[{"name":"The Ohio State University, Columbus, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ness","family":"Shroff","sequence":"additional","affiliation":[{"name":"The Ohio State University, Columbus, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,4,3]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Self-organizing data structures. Online Algorithms: The state of the art","author":"Albers Susanne","year":"1998","unstructured":"Susanne Albers and Jeffery Westbrook . 1998. Self-organizing data structures. Online Algorithms: The state of the art Vol. 1442 ( 1998 ), 13--41. Susanne Albers and Jeffery Westbrook. 1998. Self-organizing data structures. Online Algorithms: The state of the art Vol. 1442 (1998), 13--41."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/322092.322094"},{"key":"e_1_2_1_3_1","volume-title":"Spencer","author":"Alon Noga","year":"2000","unstructured":"Noga Alon and Joel H . Spencer . 2000 . The probabilistic method ( 2 nd ed.). John Wiley . Noga Alon and Joel H. Spencer. 2000. The probabilistic method (2nd ed.). John Wiley.","edition":"2"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(99)00049-8"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/332944.332951"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/954339.954341"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485891"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/359997.360000"},{"key":"e_1_2_1_9_1","volume-title":"25th International. IEEE, 1--9.","author":"Roberts James","year":"2013","unstructured":"James Roberts and Nada Sbihi . 2013 . Exploring the memory-bandwidth tradeoff in an information-centric network Teletraffic Congress (ITC), 2013 25th International. IEEE, 1--9. James Roberts and Nada Sbihi. 2013. Exploring the memory-bandwidth tradeoff in an information-centric network Teletraffic Congress (ITC), 2013 25th International. IEEE, 1--9."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007387"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1833515.1833684"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009217"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786.2793"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3835"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1075828046"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.v29:3"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2825236.2825260"},{"key":"e_1_2_1_18_1","volume-title":"Modern Operating Systems","author":"Tanenbaum Andrew S.","unstructured":"Andrew S. Tanenbaum . 2001. Modern Operating Systems ( 2 rd ed.). Prentice Hall Press , Upper Saddle River, NJ, USA. Andrew S. Tanenbaum. 2001. Modern Operating Systems (2rd ed.). Prentice Hall Press, Upper Saddle River, NJ, USA.","edition":"2"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2012.05.008"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/505696.505701"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2901318.2901332"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2013.80"},{"key":"e_1_2_1_23_1","volume-title":"Building a high-performance key-value cache as an energy-efficient appliance. Performance Evaluation","author":"Xua Yuehai","year":"2014","unstructured":"Yuehai Xua , Eitan Frachtenbergb , and Song Jiang . 2014. Building a high-performance key-value cache as an energy-efficient appliance. Performance Evaluation Vol. 79 ( September . 2014 ), 24--37. Yuehai Xua, Eitan Frachtenbergb, and Song Jiang. 2014. Building a high-performance key-value cache as an energy-efficient appliance. Performance Evaluation Vol. 79 (September. 2014), 24--37."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908557"}],"container-title":["Proceedings of the ACM on Measurement and Analysis of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3179408","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3179408","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3179408","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:17Z","timestamp":1750208897000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3179408"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,3]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,4,3]]}},"alternative-id":["10.1145\/3179408"],"URL":"https:\/\/doi.org\/10.1145\/3179408","relation":{},"ISSN":["2476-1249"],"issn-type":[{"value":"2476-1249","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4,3]]},"assertion":[{"value":"2018-04-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}