{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:21:32Z","timestamp":1750220492927,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,3,18]],"date-time":"2022-03-18T00:00:00Z","timestamp":1647561600000},"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":[[2022,3,19]]},"DOI":"10.1145\/3497776.3517768","type":"proceedings-article","created":{"date-parts":[[2022,3,18]],"date-time":"2022-03-18T17:28:13Z","timestamp":1647624493000},"page":"144-155","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Memory access scheduling to reduce thread migrations"],"prefix":"10.1145","author":[{"given":"Sana","family":"Damani","sequence":"first","affiliation":[{"name":"Georgia Institute of Technology, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prithayan","family":"Barua","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vivek","family":"Sarkar","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,3,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2018.8547571"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3286475.3286481"},{"key":"e_1_3_2_1_3_1","unstructured":"International Business Machines Corporation. [n.d.]. V12.10.0: User\u2019s Manual for CPLEX.  International Business Machines Corporation. [n.d.]. V12.10.0: User\u2019s Manual for CPLEX."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/IA3.2016.007"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(88)90333-5"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2018.00097"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3418077"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.1996.554028"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCS48598.2019.9188165"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s42514-019-00012-w"},{"key":"e_1_3_2_1_11_1","volume-title":"Lohman","author":"Li Yinan","year":"2013","unstructured":"Yinan Li , Ippokratis Pandis , Ren\u00e9 M\u00fcller , Vijayshankar Raman , and Guy M . Lohman . 2013 . NUMA-aware algorithms: the case of data shuffling. In CIDR. Yinan Li, Ippokratis Pandis, Ren\u00e9 M\u00fcller, Vijayshankar Raman, and Guy M. Lohman. 2013. NUMA-aware algorithms: the case of data shuffling. In CIDR."},{"key":"e_1_3_2_1_12_1","unstructured":"Rub\u00e9n Gran Tejero Marcos Canales Mayo. [n.d.]. jacobi-mpi. https:\/\/github.com\/mcanalesmayo\/jacobi-mpi  Rub\u00e9n Gran Tejero Marcos Canales Mayo. [n.d.]. jacobi-mpi. https:\/\/github.com\/mcanalesmayo\/jacobi-mpi"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW50202.2020.00088"},{"key":"e_1_3_2_1_15_1","volume-title":"Available online: http:\/\/polybench. sourceforge. net\/(accessed on","author":"Pouchet Louis-Noel","year":"2020","unstructured":"Louis-Noel Pouchet and Tomofumi Yuki . 2015. PolyBench\/ C 4.1. SourceForge . Available online: http:\/\/polybench. sourceforge. net\/(accessed on 12 August 2020 ). Louis-Noel Pouchet and Tomofumi Yuki. 2015. PolyBench\/C 4.1. SourceForge. Available online: http:\/\/polybench. sourceforge. net\/(accessed on 12 August 2020)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/201059.201065"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCHPC49590.2019.00009"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/IA3.2018.00013"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3210377.3210658"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018743.3018758"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC43674.2020.9286158"},{"key":"e_1_3_2_1_22_1","volume-title":"Parboil: A Revised Benchmark Suite for Scientific and Commercial Throughput Computing","author":"Stratton John A.","year":"2012","unstructured":"John A. Stratton , Christopher Rodrigrues , I- Jui Sung , Nady Obeid , Liwen Chang , Geng Liu , and Wen-Mei W. Hwu . 2012 . Parboil: A Revised Benchmark Suite for Scientific and Commercial Throughput Computing . University of Illinois at Urbana-Champaign , Urbana. John A. Stratton, Christopher Rodrigrues, I-Jui Sung, Nady Obeid, Liwen Chang, Geng Liu, and Wen-Mei W. Hwu. 2012. Parboil: A Revised Benchmark Suite for Scientific and Commercial Throughput Computing. University of Illinois at Urbana-Champaign, Urbana."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC43674.2020.9286172"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2400682.2400713"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICRC.2019.8914707"},{"key":"e_1_3_2_1_26_1","unstructured":"Tong Zhou. [n.d.]. sparse-tiling. https:\/\/gitlab.com\/tongzhou\/sparse-tiling  Tong Zhou. [n.d.]. sparse-tiling. https:\/\/gitlab.com\/tongzhou\/sparse-tiling"}],"event":{"name":"CC '22: 31st ACM SIGPLAN International Conference on Compiler Construction","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Seoul South Korea","acronym":"CC '22"},"container-title":["Proceedings of the 31st ACM SIGPLAN International Conference on Compiler Construction"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3497776.3517768","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3497776.3517768","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:49:26Z","timestamp":1750193366000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3497776.3517768"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,18]]},"references-count":25,"alternative-id":["10.1145\/3497776.3517768","10.1145\/3497776"],"URL":"https:\/\/doi.org\/10.1145\/3497776.3517768","relation":{},"subject":[],"published":{"date-parts":[[2022,3,18]]},"assertion":[{"value":"2022-03-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}