{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:18:47Z","timestamp":1750220327054,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T00:00:00Z","timestamp":1657497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Google","award":["Research Scholar Award"],"award-info":[{"award-number":["Research Scholar Award"]}]},{"name":"NSF","award":["CCF-1919223","CCF-2028949"],"award-info":[{"award-number":["CCF-1919223","CCF-2028949"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,11]]},"DOI":"10.1145\/3490148.3538559","type":"proceedings-article","created":{"date-parts":[[2022,7,10]],"date-time":"2022-07-10T22:10:15Z","timestamp":1657491015000},"page":"173-175","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Brief Announcement: Spatial Locality and Granularity Change in Caching"],"prefix":"10.1145","author":[{"given":"Nathan","family":"Beckmann","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Phillip B.","family":"Gibbons","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Charles","family":"McGuffey","sequence":"additional","affiliation":[{"name":"Reed College, Portland, OR, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Vitter","author":"Aggarwal Alok","year":"1988","unstructured":"Alok Aggarwal and Jeffrey S . Vitter . 1988 . The Input\/Output Complexity of Sorting and Related Problems. Commun. ACM 31, 9 (1988). Alok Aggarwal and Jeffrey S. Vitter. 1988. The Input\/Output Complexity of Sorting and Related Problems. Commun. ACM 31, 9 (1988)."},{"key":"e_1_3_2_1_2_1","unstructured":"Susanne Albers Sanjeev Arora and Sanjeev Khanna. 1999. Page replacement for general caching problems. In SODA.  Susanne Albers Sanjeev Arora and Sanjeev Khanna. 1999. Page replacement for general caching problems. In SODA."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.08.002"},{"key":"e_1_3_2_1_4_1","unstructured":"Bowen Alpern Larry Carter and Jeanne Ferrante. 1993. Modeling Parallel Computers as Memory Hierarchies. In Programming Models for Massively Parallel Computers.  Bowen Alpern Larry Carter and Jeanne Ferrante. 1993. Modeling Parallel Computers as Memory Hierarchies. In Programming Models for Massively Parallel Computers."},{"key":"e_1_3_2_1_5_1","unstructured":"Hagit Attiya and Gili Yavneh. 2017. Remote memory references at block granularity. In OPODIS.  Hagit Attiya and Gili Yavneh. 2017. Remote memory references at block granularity. In OPODIS."},{"key":"e_1_3_2_1_6_1","volume-title":"A unified approach to approximating resource allocation and scheduling. JACM 48, 5","author":"Bar-Noy Amotz","year":"2001","unstructured":"Amotz Bar-Noy , Reuven Bar-Yehuda , Ari Freund , Joseph Naor , and Baruch Schieber . 2001. A unified approach to approximating resource allocation and scheduling. JACM 48, 5 ( 2001 ). Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, and Baruch Schieber. 2001. A unified approach to approximating resource allocation and scheduling. JACM 48, 5 (2001)."},{"key":"e_1_3_2_1_7_1","volume-title":"Brief Announcement: Block-Granularity-Aware Caching. In SPAA.","author":"Beckmann Nathan","year":"2021","unstructured":"Nathan Beckmann , Phillip B. Gibbons , and Charles McGuffey . 2021 . Brief Announcement: Block-Granularity-Aware Caching. In SPAA. Nathan Beckmann, Phillip B. Gibbons, and Charles McGuffey. 2021. Brief Announcement: Block-Granularity-Aware Caching. In SPAA."},{"key":"e_1_3_2_1_8_1","volume-title":"Spatial Locality and Granularity Change in Caching. arXiv preprint arXiv:2205.14543","author":"Beckmann Nathan","year":"2022","unstructured":"Nathan Beckmann , Phillip B. Gibbons , and Charles McGuffey . 2022. Spatial Locality and Granularity Change in Caching. arXiv preprint arXiv:2205.14543 ( 2022 ). Nathan Beckmann, Phillip B. Gibbons, and Charles McGuffey. 2022. Spatial Locality and Granularity Change in Caching. arXiv preprint arXiv:2205.14543 (2022)."},{"key":"e_1_3_2_1_9_1","volume-title":"Phillip B. Gibbons, Vijaya Ramachandran, Shimin Chen, and Michael Kozuch.","author":"Blelloch Guy E.","year":"2008","unstructured":"Guy E. Blelloch , Rezaul Alam Chowdhury , Phillip B. Gibbons, Vijaya Ramachandran, Shimin Chen, and Michael Kozuch. 2008 . Provably good multicore cache performance for divide-andconquer algorithms. In SODA. Guy E. Blelloch, Rezaul Alam Chowdhury, Phillip B. Gibbons, Vijaya Ramachandran, Shimin Chen, and Michael Kozuch. 2008. Provably good multicore cache performance for divide-andconquer algorithms. In SODA."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2004.1255792"},{"key":"e_1_3_2_1_11_1","article-title":"New Results on Server Problems","volume":"4","author":"Chrobak Marek","year":"1991","unstructured":"Marek Chrobak , Howard J. Karloff , T. H. Payne , and Sundar Vishwanathan . 1991 . New Results on Server Problems . SIAM Journal on Discrete Mathematics 4 , 2 (1991). Marek Chrobak, Howard J. Karloff, T. H. Payne, and Sundar Vishwanathan. 1991. New Results on Server Problems. SIAM Journal on Discrete Mathematics 4, 2 (1991).","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Guy Even Moti Medina and Dror Rawitz. 2018. Online generalized caching with varying weights and costs. In SPAA.  Guy Even Moti Medina and Dror Rawitz. 2018. Online generalized caching with varying weights and costs. In SPAA.","DOI":"10.1145\/3210377.3210404"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(91)90041-V"},{"key":"e_1_3_2_1_14_1","unstructured":"Matteo Frigo Charles E. Leiserson Harald Prokop and Sridhar Ramachandran. 1999. Cache- Oblivious Algorithms. In FOCS.  Matteo Frigo Charles E. Leiserson Harald Prokop and Sridhar Ramachandran. 1999. Cache- Oblivious Algorithms. In FOCS."},{"key":"e_1_3_2_1_15_1","volume-title":"Patterson","author":"Hennessy John L.","year":"2012","unstructured":"John L. Hennessy and David A . Patterson . 2012 . Computer Architecture : A Quantitative Approach. Morgan Kaufmann . John L. Hennessy and David A. Patterson. 2012. Computer Architecture: A Quantitative Approach. Morgan Kaufmann."},{"key":"e_1_3_2_1_16_1","volume-title":"Wang","author":"Jacob Bruce L.","year":"2008","unstructured":"Bruce L. Jacob , Spencer W. Ng , and David T . Wang . 2008 . Memory Systems : Cache, DRAM, Disk. Morgan Kaufmann . Bruce L. Jacob, Spencer W. Ng, and David T. Wang. 2008. Memory Systems: Cache, DRAM, Disk. Morgan Kaufmann."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Djordje Jevdjic Gabriel H. Loh Cansu Kaynak and Babak Falsafi. 2014. Unison cache: A scalable and effective die-stacked DRAM cache. In MICRO.  Djordje Jevdjic Gabriel H. Loh Cansu Kaynak and Babak Falsafi. 2014. Unison cache: A scalable and effective die-stacked DRAM cache. In MICRO.","DOI":"10.1109\/MICRO.2014.51"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Djordje Jevdjic Stavros Volos and Babak Falsafi. 2013. Die-stacked DRAM caches for servers: Hit ratio latency or bandwidth? have it all with footprint cache. In ISCA.  Djordje Jevdjic Stavros Volos and Babak Falsafi. 2013. Die-stacked DRAM caches for servers: Hit ratio latency or bandwidth? have it all with footprint cache. In ISCA.","DOI":"10.1145\/2485922.2485957"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Onur Mutlu and Thomas Moscibroda. 2007. Stall-time fair memory access scheduling for chip multiprocessors. In MICRO.  Onur Mutlu and Thomas Moscibroda. 2007. Stall-time fair memory access scheduling for chip multiprocessors. In MICRO.","DOI":"10.1109\/MICRO.2007.21"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Onur Mutlu and Thomas Moscibroda. 2008. Parallelism-aware batch scheduling: Enhancing both performance and fairness of shared DRAM systems. In ISCA.  Onur Mutlu and Thomas Moscibroda. 2008. Parallelism-aware batch scheduling: Enhancing both performance and fairness of shared DRAM systems. In ISCA.","DOI":"10.1109\/ISCA.2008.7"},{"key":"e_1_3_2_1_22_1","volume-title":"Loh","author":"Qureshi Moinuddin K.","year":"2012","unstructured":"Moinuddin K. Qureshi and Gabe H . Loh . 2012 . Fundamental latency trade-off in architecting DRAM caches: Outperforming impractical SRAM-tags with a simple and practical design. In MICRO. Moinuddin K. Qureshi and Gabe H. Loh. 2012. Fundamental latency trade-off in architecting DRAM caches: Outperforming impractical SRAM-tags with a simple and practical design. In MICRO."},{"key":"e_1_3_2_1_23_1","volume-title":"Tarjan","author":"Sleator Daniel D.","year":"1985","unstructured":"Daniel D. Sleator and Robert E . Tarjan . 1985 . Amortized efficiency of list update and paging rules. Commun. ACM 28, 2 (1985). Daniel D. Sleator and Robert E. Tarjan. 1985. Amortized efficiency of list update and paging rules. Commun. ACM 28, 2 (1985)."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Kshitij Sudan Niladrish Chatterjee David Nellans Manu Awasthi Rajeev Balasubramonian and Al Davis. 2010. Micro-pages: increasing DRAM efficiency with locality-aware data placement. In ASPLOS.  Kshitij Sudan Niladrish Chatterjee David Nellans Manu Awasthi Rajeev Balasubramonian and Al Davis. 2010. Micro-pages: increasing DRAM efficiency with locality-aware data placement. In ASPLOS.","DOI":"10.1145\/1736020.1736045"},{"key":"e_1_3_2_1_25_1","volume-title":"Davis","author":"Xu Ying","year":"2009","unstructured":"Ying Xu , Aabhas S. Agarwal , and Brian T . Davis . 2009 . Prediction in dynamic SDRAM controller policies. In SAMOS. Ying Xu, Aabhas S. Agarwal, and Brian T. Davis. 2009. Prediction in dynamic SDRAM controller policies. In SAMOS."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"HanBin Yoon Justin Meza Rachata Ausavarungnirun Rachael A. Harding and Onur Mutlu. 2012. Row buffer locality aware caching policies for hybrid memories. In ICCD.  HanBin Yoon Justin Meza Rachata Ausavarungnirun Rachael A. Harding and Onur Mutlu. 2012. Row buffer locality aware caching policies for hybrid memories. In ICCD.","DOI":"10.1109\/ICCD.2012.6378661"},{"key":"e_1_3_2_1_27_1","volume-title":"The k-server dual and loose competitiveness for paging. Algorithmica 11, 6","author":"Young Neal","year":"1994","unstructured":"Neal Young . 1994. The k-server dual and loose competitiveness for paging. Algorithmica 11, 6 ( 1994 ). Neal Young. 1994. The k-server dual and loose competitiveness for paging. Algorithmica 11, 6 (1994)."}],"event":{"name":"SPAA '22: 34th 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":"Philadelphia PA USA","acronym":"SPAA '22"},"container-title":["Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490148.3538559","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490148.3538559","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490148.3538559","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:08Z","timestamp":1750191128000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490148.3538559"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,11]]},"references-count":26,"alternative-id":["10.1145\/3490148.3538559","10.1145\/3490148"],"URL":"https:\/\/doi.org\/10.1145\/3490148.3538559","relation":{},"subject":[],"published":{"date-parts":[[2022,7,11]]},"assertion":[{"value":"2022-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}