{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:19:08Z","timestamp":1750220348955,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T00:00:00Z","timestamp":1625529600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"US-Israel Binational Science Foundation"},{"name":"Israel Science Foundation"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,6]]},"DOI":"10.1145\/3409964.3461801","type":"proceedings-article","created":{"date-parts":[[2021,6,30]],"date-time":"2021-06-30T23:07:02Z","timestamp":1625094422000},"page":"94-104","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Online Weighted Multi-Level Paging"],"prefix":"10.1145","author":[{"given":"Nikhil","family":"Bansal","sequence":"first","affiliation":[{"name":"CWI Amsterdam & TU Eindhoven, Amsterdam and Eindhoven, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph (Seffi)","family":"Naor","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ohad","family":"Talmon","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,7,6]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Competitive analysis of randomized paging algorithms. Theoretical Computer Science, 234(1--2):203--218","author":"Achlioptas Dimitris","year":"2000","unstructured":"Dimitris Achlioptas , Marek Chrobak , and John Noga . Competitive analysis of randomized paging algorithms. Theoretical Computer Science, 234(1--2):203--218 , 2000 . Dimitris Achlioptas, Marek Chrobak, and John Noga. Competitive analysis of randomized paging algorithms. Theoretical Computer Science, 234(1--2):203--218, 2000."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3280826"},{"key":"e_1_3_2_1_3_1","first-page":"31","volume-title":"Symposium on Discrete Algorithms","author":"Albers Susanne","year":"1999","unstructured":"Susanne Albers , Sanjeev Arora , and Sanjeev Khanna . Page replacement for general caching problems . In Symposium on Discrete Algorithms , pages 31 -- 40 , 1999 . Susanne Albers, Sanjeev Arora, and Sanjeev Khanna. Page replacement for general caching problems. In Symposium on Discrete Algorithms, pages 31--40, 1999."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780558"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339123.2339126"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/090779000"},{"key":"e_1_3_2_1_7_1","volume-title":"Symposium on Discrete Algorithms","author":"Bansal Nikhil","year":"2010","unstructured":"Nikhil Bansal , Niv Buchbinder , and Joseph (Seffi) Naor . Towards the randomized- server conjecture: A primal-dual approach . In Symposium on Discrete Algorithms , 2010 . Nikhil Bansal, Niv Buchbinder, and Joseph (Seffi) Naor. Towards the randomized- server conjecture: A primal-dual approach. In Symposium on Discrete Algorithms, 2010."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976021.1"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935767"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2018.00081"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755604"},{"key":"e_1_3_2_1_12_1","first-page":"1","volume-title":"European Symposium on Algorithms, ESA","volume":"57","author":"Blelloch Guy E.","year":"2016","unstructured":"Guy E. Blelloch , Jeremy T. Fineman , Phillip B. Gibbons , Yan Gu , and Julian Shun . Efficient algorithms with asymmetric read and write costs . In European Symposium on Algorithms, ESA , volume 57 of LIPIcs, pages 14: 1 -- 14 :18, 2016 . Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, and Julian Shun. Efficient algorithms with asymmetric read and write costs. In European Symposium on Algorithms, ESA, volume 57 of LIPIcs, pages 14:1--14:18, 2016."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3210377.3210380"},{"key":"e_1_3_2_1_14_1","volume-title":"What to do with your free time: algorithms for infrequent requests and randomized weighted caching","author":"Blum A.","year":"1996","unstructured":"A. Blum , M. Furst , and A. Tomkins . What to do with your free time: algorithms for infrequent requests and randomized weighted caching , 1996 . A. Blum, M. Furst, and A. Tomkins. What to do with your free time: algorithms for infrequent requests and randomized weighted caching, 1996."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814617"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188798"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.32"},{"key":"e_1_3_2_1_18_1","volume-title":"Joseph Seffi Naor, et al. The design of competitive online algorithms via a primal--dual approach. Foundations and Trends\u00ae in Theoretical Computer Science, 3(2--3):93--263","author":"Buchbinder Niv","year":"2009","unstructured":"Niv Buchbinder , Joseph Seffi Naor, et al. The design of competitive online algorithms via a primal--dual approach. Foundations and Trends\u00ae in Theoretical Computer Science, 3(2--3):93--263 , 2009 . Niv Buchbinder, Joseph Seffi Naor, et al. The design of competitive online algorithms via a primal--dual approach. Foundations and Trends\u00ae in Theoretical Computer Science, 3(2--3):93--263, 2009."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2016.114"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/0220008"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3210377.3210404"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1095"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"e_1_3_2_1_24_1","volume-title":"Thesis work, unpublished","author":"Feige U.","year":"2005","unstructured":"U. Feige and S. Korman . On the use of randomization in the online set-cover problem . In Thesis work, unpublished , 2005 . U. Feige and S. Korman. On the use of randomization in the online set-cover problem. In Thesis work, unpublished, 2005."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(91)90041-V"},{"key":"e_1_3_2_1_26_1","first-page":"1","volume-title":"European Symposium on Algorithms, ESA","volume":"112","author":"Gu Yan","year":"2018","unstructured":"Yan Gu , Yihan Sun , and Guy E. Blelloch . Algorithmic building blocks for asymmetric memories . In European Symposium on Algorithms, ESA , volume 112 of LIPIcs, pages 44: 1 -- 44 :15, 2018 . Yan Gu, Yihan Sun, and Guy E. Blelloch. Algorithmic building blocks for asymmetric memories. In European Symposium on Algorithms, ESA, volume 112 of LIPIcs, pages 44:1--44:15, 2018."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.10"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384277"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0095-6"},{"key":"e_1_3_2_1_30_1","volume-title":"Proc. of the Dagstuhl Seminar on Online Algorithms","author":"Irani Sandy","year":"1996","unstructured":"Sandy Irani . Competitive analysis of paging: A survey . In Proc. of the Dagstuhl Seminar on Online Algorithms , 1996 . Sandy Irani. Competitive analysis of paging: A survey. In Proc. of the Dagstuhl Seminar on Online Algorithms, 1996."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258666"},{"key":"e_1_3_2_1_32_1","first-page":"283","volume-title":"USENIX Conference on File and Storage Technologies (FAST 20)","author":"Kumar Abhishek Vijaya","year":"2020","unstructured":"Abhishek Vijaya Kumar and Muthian Sivathanu . Quiver : An informed storage cache for deep learning . In USENIX Conference on File and Storage Technologies (FAST 20) , pages 283 -- 296 , 2020 . Abhishek Vijaya Kumar and Muthian Sivathanu. Quiver: An informed storage cache for deep learning. In USENIX Conference on File and Storage Technologies (FAST 20), pages 283--296, 2020."},{"key":"e_1_3_2_1_33_1","first-page":"3302","volume-title":"International Conference on Machine Learning, ICML, 2018","volume":"80","author":"Lykouris Thodoris","year":"2018","unstructured":"Thodoris Lykouris and Sergei Vassilvitskii . Competitive caching with machine learned advice . In International Conference on Machine Learning, ICML, 2018 , volume 80 , pages 3302 -- 3311 , 2018 . Thodoris Lykouris and Sergei Vassilvitskii. Competitive caching with machine learned advice. In International Conference on Machine Learning, ICML, 2018, volume 80, pages 3302--3311, 2018."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01759073"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786.2793"},{"key":"e_1_3_2_1_36_1","volume-title":"USENIX Workshop on Hot Topics in Storage and File Systems, HotStorage","author":"Wu Kan","year":"2019","unstructured":"Kan Wu , Andrea C. Arpaci-Dusseau , and Remzi H . Arpaci-Dusseau. Towards an unwritten contract of intel optane SSD . In USENIX Workshop on Hot Topics in Storage and File Systems, HotStorage , 2019 . Kan Wu, Andrea C. Arpaci-Dusseau, and Remzi H. Arpaci-Dusseau. Towards an unwritten contract of intel optane SSD. In USENIX Workshop on Hot Topics in Storage and File Systems, HotStorage, 2019."},{"key":"e_1_3_2_1_37_1","first-page":"241","volume-title":"Symposium on Discrete algorithms","author":"Young Neal","year":"1991","unstructured":"Neal Young . On-line caching as cache size varies . In Symposium on Discrete algorithms , pages 241 -- 250 , 1991 . Neal Young. On-line caching as cache size varies. In Symposium on Discrete algorithms, pages 241--250, 1991."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01189992"},{"key":"e_1_3_2_1_39_1","first-page":"82","volume-title":"Symposium on Discrete algorithms","author":"Young Neal E.","year":"1998","unstructured":"Neal E. Young . On-line file caching . In Symposium on Discrete algorithms , pages 82 -- 86 , 1998 . Neal E. Young. On-line file caching. In Symposium on Discrete algorithms, pages 82--86, 1998."}],"event":{"name":"SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Virtual Event USA","acronym":"SPAA '21"},"container-title":["Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409964.3461801","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3409964.3461801","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:08Z","timestamp":1750191428000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409964.3461801"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,6]]},"references-count":39,"alternative-id":["10.1145\/3409964.3461801","10.1145\/3409964"],"URL":"https:\/\/doi.org\/10.1145\/3409964.3461801","relation":{},"subject":[],"published":{"date-parts":[[2021,7,6]]},"assertion":[{"value":"2021-07-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}