{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T07:22:50Z","timestamp":1777965770568,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,6]],"date-time":"2020-07-06T00:00:00Z","timestamp":1593993600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,6]]},"DOI":"10.1145\/3350755.3400231","type":"proceedings-article","created":{"date-parts":[[2020,7,9]],"date-time":"2020-07-09T15:56:12Z","timestamp":1594310172000},"page":"493-495","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Green Paging and Parallel Paging"],"prefix":"10.1145","author":[{"given":"Kunal","family":"Agrawal","sequence":"first","affiliation":[{"name":"Washington University in St. Louis, St. Louis, MO, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael A.","family":"Bender","sequence":"additional","affiliation":[{"name":"Stony Brook University, Stony Brook, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rathish","family":"Das","sequence":"additional","affiliation":[{"name":"Stony Brook University, Stony Brook, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William","family":"Kuszmaul","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enoch","family":"Peserico","sequence":"additional","affiliation":[{"name":"University of Padova, Padova, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michele","family":"Scquizzato","sequence":"additional","affiliation":[{"name":"University of Padova, Padova, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,7,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797324278"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1147\/sj.52.0078"},{"key":"e_1_3_2_1_3_1","volume-title":"Cache-Adaptive Algorithms. In Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 958--971","author":"Bender Michael A.","year":"2014","unstructured":"Michael A. Bender , Roozbeh Ebrahimi , Jeremy T. Fineman , Golnaz Ghasemiesfeh , Rob Johnson , and Samuel McCauley . 2014 . Cache-Adaptive Algorithms. In Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 958--971 . Michael A. Bender, Roozbeh Ebrahimi, Jeremy T. Fineman, Golnaz Ghasemiesfeh, Rob Johnson, and Samuel McCauley. 2014. Cache-Adaptive Algorithms. In Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 958--971."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146588"},{"key":"e_1_3_2_1_5_1","volume-title":"Proceedings of the USENIX","author":"Cao Pei","year":"1994","unstructured":"Pei Cao , Edward W. Felten , and Kai Li . 1994 . Application-controlled file caching policies . In Proceedings of the USENIX Summer 1994 Technical Conference (USTC) (Boston, Massachusetts). 171--182. Pei Cao, Edward W. Felten, and Kai Li. 1994. Application-controlled file caching policies. In Proceedings of the USENIX Summer 1994 Technical Conference (USTC) (Boston, Massachusetts). 171--182."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1907450.1907547"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3350755.3400233"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0073-z"},{"key":"e_1_3_2_1_9_1","volume-title":"Proceedings of the 27th annual ACM Symposium on Theory of Computing (STOC). 626--634","author":"Fiat Amos","unstructured":"Amos Fiat and Anna R. Karlin . 1995. Randomized and multipointer paging with locality of reference . In Proceedings of the 27th annual ACM Symposium on Theory of Computing (STOC). 626--634 . Amos Fiat and Anna R. Karlin. 1995. Randomized and multipointer paging with locality of reference. In Proceedings of the 27th annual ACM Symposium on Theory of Computing (STOC). 626--634."},{"key":"e_1_3_2_1_10_1","volume-title":"Elastic Caching. In Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 143--156","author":"Gupta Anupam","year":"2019","unstructured":"Anupam Gupta , Ravishankar Krishnaswamy , Amit Kumar , and Debmalya Panigrahi . 2019 . Elastic Caching. In Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 143--156 . Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, and Debmalya Panigrahi. 2019. Elastic Caching. In Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 143--156."},{"key":"e_1_3_2_1_11_1","volume-title":"Proceedings of 1st Symposium on Innovations in Computer Science (ICS). 501--509","author":"Hassidim Avinatan","year":"2010","unstructured":"Avinatan Hassidim . 2010 . Cache Replacement Policies for Multicore Processors . In Proceedings of 1st Symposium on Innovations in Computer Science (ICS). 501--509 . Avinatan Hassidim. 2010. Cache Replacement Policies for Multicore Processors. In Proceedings of 1st Symposium on Innovations in Computer Science (ICS). 501--509."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2012.29"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.113"},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of the 10th Workshop on Approximation and Online Algorithms (WAOA). 145--158","author":"L\u00f3pez-Ortiz Alejandro","year":"2012","unstructured":"Alejandro L\u00f3pez-Ortiz and Alejandro Salinger . 2012 a. Minimizing Cache Usage in Paging . In Proceedings of the 10th Workshop on Approximation and Online Algorithms (WAOA). 145--158 . Alejandro L\u00f3pez-Ortiz and Alejandro Salinger. 2012a. Minimizing Cache Usage in Paging. In Proceedings of the 10th Workshop on Approximation and Online Algorithms (WAOA). 145--158."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090246"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1147\/sj.92.0078"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755585"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465529.2479781"},{"key":"e_1_3_2_1_19_1","volume-title":"Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science (STACS). 56:1--56:18","author":"Peserico Enoch","year":"2019","unstructured":"Enoch Peserico . 2019 . Paging with dynamic memory capacity . In Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science (STACS). 56:1--56:18 . Enoch Peserico. 2019. Paging with dynamic memory capacity. In Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science (STACS). 56:1--56:18."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786.2793"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.165388"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:SUPE.0000014800.27383.8f"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.144619"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009192"}],"event":{"name":"SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures","location":"Virtual Event USA","acronym":"SPAA '20","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"]},"container-title":["Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3350755.3400231","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3350755.3400231","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:13:35Z","timestamp":1750202015000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3350755.3400231"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,6]]},"references-count":24,"alternative-id":["10.1145\/3350755.3400231","10.1145\/3350755"],"URL":"https:\/\/doi.org\/10.1145\/3350755.3400231","relation":{},"subject":[],"published":{"date-parts":[[2020,7,6]]},"assertion":[{"value":"2020-07-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}