{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:04:11Z","timestamp":1750309451360,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":49,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,9,30]],"date-time":"2024-09-30T00:00:00Z","timestamp":1727654400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100011661","name":"Pacific Northwest National Laboratory","doi-asserted-by":"publisher","award":["DE-AC05-76RL01830"],"award-info":[{"award-number":["DE-AC05-76RL01830"]}],"id":[{"id":"10.13039\/100011661","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,9,30]]},"DOI":"10.1145\/3695794.3695820","type":"proceedings-article","created":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T04:06:53Z","timestamp":1733976413000},"page":"270-284","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["MemFriend: Understanding Memory Performance with Spatial-Temporal Affinity"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4778-4581","authenticated-orcid":false,"given":"Yasodha","family":"Suriyakumar","sequence":"first","affiliation":[{"name":"Portland State University, Portland, OR, United States"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4297-3057","authenticated-orcid":false,"given":"Nathan R","family":"Tallent","sequence":"additional","affiliation":[{"name":"Pacific Northwest National Laboratory, Richland, WA, United States"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4313-1882","authenticated-orcid":false,"given":"Andres","family":"Marquez","sequence":"additional","affiliation":[{"name":"Pacific Northwest National Laboratory, Richland, WA, United States"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-9971-6353","authenticated-orcid":false,"given":"Karen L","family":"Karavanic","sequence":"additional","affiliation":[{"name":"Portland State University, Portland, OR, United States"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2129-408X","authenticated-orcid":false,"given":"Ozgur O","family":"Kilic","sequence":"additional","affiliation":[{"name":"Brookhaven National Laboratory, Upton, NY, USA"}]}],"member":"320","published-online":{"date-parts":[[2024,12,11]]},"reference":[{"key":"e_1_3_3_1_2_2","first-page":"1","volume-title":"1st Workshop on Near-Data Processing","author":"Anghel Andreea","year":"2013","unstructured":"Andreea Anghel, Gero Dittmann, Rik Jongerius, and R Luijten. 2013. Spatio-Temporal Locality Characterization. In 1st Workshop on Near-Data Processing. 1\u20135."},{"key":"e_1_3_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2014.6835935"},{"key":"e_1_3_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/3286062.3286082"},{"key":"e_1_3_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2019.8916398"},{"key":"e_1_3_3_1_6_2","doi-asserted-by":"crossref","unstructured":"Trishul\u00a0M Chilimbi. 2001. Efficient representations and abstractions for quantifying and exploiting data reference locality. ACM SIGPLAN Notices 36 5 (2001) 191\u2013202.","DOI":"10.1145\/381694.378840"},{"key":"e_1_3_3_1_7_2","doi-asserted-by":"crossref","unstructured":"Timothy\u00a0A Davis and Yifan Hu. 2011. The University of Florida sparse matrix collection. ACM Transactions on Mathematical Software (TOMS) 38 1 (2011) 1\u201325.","DOI":"10.1145\/2049662.2049663"},{"key":"e_1_3_3_1_8_2","first-page":"261","volume-title":"USENIX Annual Technical Conference","volume":"7","author":"Ding Xiaoning","year":"2007","unstructured":"Xiaoning Ding, Song Jiang, Feng Chen, Kei Davis, and Xiaodong Zhang. 2007. DiskSeen: Exploiting Disk Layout and Access History to Enhance I\/O Prefetch.. In USENIX Annual Technical Conference, Vol.\u00a07. 261\u2013274."},{"key":"e_1_3_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/2000064.2000108"},{"key":"e_1_3_3_1_10_2","unstructured":"Georgi Gerganov. 2023. Alpaca.cpp: Inference of Meta\u2019s LLaMA model (and others) in pure C\/C++. https:\/\/github.com\/antimatter15\/alpaca.cpp."},{"key":"e_1_3_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/PMBS.2018.8641631"},{"key":"e_1_3_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/1542431.1542446"},{"key":"e_1_3_3_1_13_2","doi-asserted-by":"crossref","unstructured":"Saurabh Gupta Ping Xiang Yi Yang and Huiyang Zhou. 2013. Locality principle revisited: A probability-based quantitative approach. J. Parallel and Distrib. Comput. 73 7 (2013) 1011\u20131027.","DOI":"10.1016\/j.jpdc.2013.01.010"},{"key":"e_1_3_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICEAC.2015.7352208"},{"key":"e_1_3_3_1_15_2","unstructured":"Milad Hashemi Kevin Swersky Jamie\u00a0A Smith Grant Ayers Heiner Litz Jichuan Chang Christos Kozyrakis and Parthasarathy Ranganathan. 2018. Learning memory access patterns. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/1803.02329 (2018)."},{"key":"e_1_3_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87779-0_24"},{"key":"e_1_3_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2016.17"},{"key":"e_1_3_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113355"},{"key":"e_1_3_3_1_19_2","unstructured":"Ozgur Kilic Yasodha Suriyakumar Nathan\u00a0R. Tallent and Andr\u00e9s Marquez. 2024. MemGaze. https:\/\/github.com\/pnnl\/memgaze."},{"key":"e_1_3_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS48437.2020.00047"},{"key":"e_1_3_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/CLUSTER51413.2022.00058"},{"key":"e_1_3_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/NVMSA.2016.7547186"},{"key":"e_1_3_3_1_23_2","volume-title":"HiarTI: A Hierarchical Parallel Tensor Infrastructure","author":"Li Jiajia","year":"2020","unstructured":"Jiajia Li and PNNL\u00a0Developer Central. 2020. HiarTI: A Hierarchical Parallel Tensor Infrastructure. https:\/\/github.com\/pnnl\/HiParTI Last accessed: 2023-03-20."},{"key":"e_1_3_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2018.00022"},{"key":"e_1_3_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/3330345.3330366"},{"key":"e_1_3_3_1_26_2","doi-asserted-by":"publisher","unstructured":"Zhenmin Li Zhifeng Chen and Yuanyuan Zhou. 2005. Mining Block Correlations to Improve Storage Performance. ACM Trans. Storage 1 2 (may 2005) 213\u2013245. 10.1145\/1063786.1063790https:\/\/dl.acm.org\/doi\/10.1145\/1063786.1063790","DOI":"10.1145\/1063786.1063790"},{"key":"e_1_3_3_1_27_2","first-page":"289","volume-title":"Proceedings of the 28th Annual International Conference on Computer Science and Software Engineering","author":"Liu Yumeng","year":"2018","unstructured":"Yumeng Liu, Daniel Busaba, Chen Ding, and Daniel Gildea. 2018. All timescale window co-occurrence: efficient analysis and a possible use. In Proceedings of the 28th Annual International Conference on Computer Science and Software Engineering. 289\u2013292."},{"key":"e_1_3_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2017.11"},{"key":"e_1_3_3_1_29_2","doi-asserted-by":"publisher","unstructured":"R.\u00a0L. Mattson J. Gecsei D.\u00a0R. Slutz and I.\u00a0L. Traiger. 1970. Evaluation techniques for storage hierarchies. IBM Systems Journal 9 2 (1970) 78\u2013117. 10.1147\/sj.92.0078 https:\/\/dl.acm.org\/doi\/10.1147\/sj.92.0078","DOI":"10.1147\/sj.92.0078"},{"key":"e_1_3_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/977091.977115"},{"key":"e_1_3_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/3240302.3240417"},{"key":"e_1_3_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCS55155.2022.9846314"},{"key":"e_1_3_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/2749469.2749473"},{"key":"e_1_3_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPCC-CSS-ICESS.2015.175"},{"key":"e_1_3_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/3352460.3358319"},{"key":"e_1_3_3_1_36_2","volume-title":"FROSTT: The Formidable Repository of Open Sparse Tensors and Tools","author":"Smith Shaden","year":"2017","unstructured":"Shaden Smith, Jee\u00a0W. Choi, Jiajia Li, Richard Vuduc, Jongsoo Park, Xing Liu, and George Karypis. 2017. FROSTT: The Formidable Repository of Open Sparse Tensors and Tools. http:\/\/frostt.io\/ Last accessed: 2023-03-20."},{"key":"e_1_3_3_1_37_2","volume-title":"Annual Symposium on Combinatorial Pattern Matching","author":"Sobel Joshua","year":"2020","unstructured":"Joshua Sobel, Noah Bertram, Chen Ding, Fatemeh Nargesian, and Daniel Gildea. 2020. AWLCO: All-Window Length Co-Occurrence. In Annual Symposium on Combinatorial Pattern Matching."},{"key":"e_1_3_3_1_38_2","unstructured":"Rohan Taori Ishaan Gulrajani Tianyi Zhang Yann Dubois Xuechen Li Carlos Guestrin Percy Liang and Tatsunori\u00a0B. Hashimoto. 2023. Stanford Alpaca: An Instruction-following LLaMA model. https:\/\/github.com\/tatsu-lab\/stanford_alpaca."},{"key":"e_1_3_3_1_39_2","unstructured":"Thibaut\u00a0G. Tessil. 2019. Tessil hopscotch-map. github.com\/Tessil\/hopscotch-map."},{"key":"e_1_3_3_1_40_2","unstructured":"Hugo Touvron Louis Martin Kevin Stone Peter Albert Amjad Almahairi Yasmine Babaei Nikolay Bashlykov Soumya Batra Prajjwal Bhargava Shruti Bhosale et\u00a0al. 2023. Llama 2: Open foundation and fine-tuned chat models. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2307.09288 (2023)."},{"key":"e_1_3_3_1_41_2","volume-title":"XSBench","author":"Tramm John","year":"2021","unstructured":"John Tramm, Ron Rahaman, Amanda Lund, and others contributors. 2021. XSBench. https:\/\/github.com\/ANL-CESAR\/XSBench Last accessed: 2023-03-20."},{"key":"e_1_3_3_1_42_2","volume-title":"PHYSOR 2014 - The Role of Reactor Physics toward a Sustainable Future","author":"Tramm John\u00a0R","year":"2014","unstructured":"John\u00a0R Tramm, Andrew\u00a0R Siegel, Tanzima Islam, and Martin Schulz. 2014. XSBench - The Development and Verification of a Performance Abstraction for Monte Carlo Reactor Analysis. In PHYSOR 2014 - The Role of Reactor Physics toward a Sustainable Future. Kyoto. https:\/\/www.mcs.anl.gov\/papers\/P5064-0114.pdf"},{"key":"e_1_3_3_1_43_2","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2012.6232367"},{"key":"e_1_3_3_1_44_2","unstructured":"Nan Wu and Pengcheng Li. 2020. Phoebe: Reuse-Aware Online Caching with Reinforcement Learning for Emerging Storage Models. arxiv:https:\/\/arXiv.org\/abs\/2011.07160\u00a0[cs.PF]"},{"key":"e_1_3_3_1_45_2","doi-asserted-by":"crossref","unstructured":"Wm\u00a0A Wulf and Sally\u00a0A McKee. 1995. Hitting the memory wall: Implications of the obvious. ACM SIGARCH computer architecture news 23 1 (1995) 20\u201324.","DOI":"10.1145\/216585.216588"},{"key":"e_1_3_3_1_46_2","doi-asserted-by":"publisher","unstructured":"Xiaoya Xiang Chen Ding Hao Luo and Bin Bao. 2013. HOTL: A Higher Order Theory of Locality. SIGARCH Comput. Archit. News 41 1 (March 2013) 343\u2013356. 10.1145\/2490301.2451153https:\/\/dl.acm.org\/doi\/10.1145\/2490301.2451153","DOI":"10.1145\/2490301.2451153"},{"key":"e_1_3_3_1_47_2","doi-asserted-by":"publisher","unstructured":"Liang Yuan Chen Ding Wesley Smith Peter Denning and Yunquan Zhang. 2019. A Relational Theory of Locality. ACM Trans. Archit. Code Optim. 16 3 Article 33 (Aug. 2019) 26\u00a0pages. 10.1145\/3341109https:\/\/dl.acm.org\/doi\/10.1145\/3341109","DOI":"10.1145\/3341109"},{"key":"e_1_3_3_1_48_2","doi-asserted-by":"crossref","unstructured":"Chengliang Zhang Chen Ding Mitsunori Ogihara Yutao Zhong and Youfeng Wu. 2006. A hierarchical model of data locality. ACM SIGPLAN Notices 41 1 (2006) 16\u201329.","DOI":"10.1145\/1111320.1111040"},{"key":"e_1_3_3_1_49_2","unstructured":"Chengliang Zhang Yutao Zhong Chen Ding and Mitsunori Ogihara. 2004. Finding the Reference Affinity Groups in Trace using Sampling Method. http:\/\/hdl.handle.net\/1802\/1028"},{"key":"e_1_3_3_1_50_2","doi-asserted-by":"crossref","unstructured":"Yutao Zhong Maksim Orlovich Xipeng Shen and Chen Ding. 2004. Array regrouping and structure splitting using whole-program reference affinity. ACM SIGPLAN Notices 39 6 (2004) 255\u2013266.","DOI":"10.1145\/996893.996872"}],"event":{"name":"MEMSYS '24: The International Symposium on Memory Systems","acronym":"MEMSYS '24","location":"Washington DC USA"},"container-title":["Proceedings of the International Symposium on Memory Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3695794.3695820","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3695794.3695820","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3695794.3695820","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:10:06Z","timestamp":1750295406000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3695794.3695820"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,30]]},"references-count":49,"alternative-id":["10.1145\/3695794.3695820","10.1145\/3695794"],"URL":"https:\/\/doi.org\/10.1145\/3695794.3695820","relation":{},"subject":[],"published":{"date-parts":[[2024,9,30]]},"assertion":[{"value":"2024-12-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}