{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T04:16:52Z","timestamp":1777954612282,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T00:00:00Z","timestamp":1752624000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100006374","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-2106699, CCF-2107280, PPoSS-2216971, CCF 2247577, CCF 2106827, CCF-2209654, CCF-2121744, CCF-2218677"],"award-info":[{"award-number":["CCF-2106699, CCF-2107280, PPoSS-2216971, CCF 2247577, CCF 2106827, CCF-2209654, CCF-2121744, CCF-2218677"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ONR","award":["13533312, N000142212702"],"award-info":[{"award-number":["13533312, N000142212702"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,16]]},"DOI":"10.1145\/3694906.3743336","type":"proceedings-article","created":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T16:19:56Z","timestamp":1752682796000},"page":"171-180","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Managing High-Bandwidth Memory is a Parallel Scheduling Problem (full paper only)"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5882-6647","authenticated-orcid":false,"given":"Kunal","family":"Agrawal","sequence":"first","affiliation":[{"name":"Washington University in St. Louis, St. Louis, Missouri, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7639-530X","authenticated-orcid":false,"given":"Michael A.","family":"Bender","sequence":"additional","affiliation":[{"name":"Stony Brook University, Stony Brook, New York, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5680-1753","authenticated-orcid":false,"given":"Kirk","family":"Pruhs","sequence":"additional","affiliation":[{"name":"University of Pittsburgh, Pittsburgh, Pennsylvania, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8162-017X","authenticated-orcid":false,"given":"Benjamin","family":"Moseley","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, Pennsylvania, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0614-6620","authenticated-orcid":false,"given":"Clifford","family":"Stein","sequence":"additional","affiliation":[{"name":"Columbia University, New York City, New York, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,7,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28428"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"A. Aggarwal A.K. Chandra and M. Snir. 1990. Communication Complexity of PRAMs. Theoretical Computer Science (March 1990) 3--28.","DOI":"10.1016\/0304-3975(90)90188-N"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/48529.48535"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","unstructured":"Kunal Agrawal Michael A. Bender Rathish Das William Kuszmaul Enoch Peserico and Michele Scquizzato. [n.d.]. Tight Bounds for Parallel Paging and Green Paging. 3022--3041. https:\/\/doi.org\/10.1137\/1.9781611976465.180 arXiv:https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/1.9781611976465.180","DOI":"10.1137\/1.9781611976465.180"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490148.3538577"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1996.548514"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0071-1"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378533.1378573"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2015.94"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2016.12.009"},{"key":"e_1_3_2_1_11_1","volume-title":"Proc. 2015 International Symposium on Memory Systems, (MEMSYS), Bruce Jacob (Ed.). Washington DC, USA, 197--205","author":"Bender Michael A.","unstructured":"Michael A. Bender, Jonathan W. Berry, Simon D. Hammond, Branden Moore, Benjamin Moseley, and Cynthia A. Phillips. 2015. k-Means Clustering on Two-Level Memory Systems. In Proc. 2015 International Symposium on Memory Systems, (MEMSYS), Bruce Jacob (Ed.). Washington DC, USA, 197--205."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3323165.3323210"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1347082.1347137"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3225058.3225116"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Chansup Byun Jeremy Kepner William Arcand David Bestor Bill Bergeron Vijay Gadepally Michael Houle Matthew Hubbell Michael Jones Anna Klein et al. 2017. Benchmarking data analysis and machine learning applications on the Intel KNL many-core processor. arXiv preprint arXiv:1707.03515 (2017).","DOI":"10.1109\/HPEC.2017.8091067"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1248377.1248396"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3350755.3400233"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3323165.3323209"},{"key":"e_1_3_2_1_19_1","first-page":"21","article-title":"New results on fair multi-threaded paging","volume":"1","author":"de Loma Alejandro Strejilevich","year":"1998","unstructured":"Alejandro Strejilevich de Loma. 1998. New results on fair multi-threaded paging. Electronic Journal of SADIO 1, 1 (1998), 21--36.","journal-title":"Electronic Journal of SADIO"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490148.3538570"},{"key":"e_1_3_2_1_21_1","volume-title":"30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013","volume":"549","author":"D\u00f3sa Gy\u00f6rgy","year":"2013","unstructured":"Gy\u00f6rgy D\u00f3sa and Jir\u00ed Sgall. 2013. First Fit bin packing: A tight analysis. In 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27-March 2, 2013, Kiel, Germany (LIPIcs, Vol. 20), Natacha Portier and Thomas Wilke (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 538--549."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229163.2229172"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0073-z"},{"key":"e_1_3_2_1_24_1","volume-title":"Proc. Innovations in Computer Science (ICS), Andrew Chi-Chih Yao (Ed.). 501--509","author":"Hassidim Avinatan","year":"2010","unstructured":"Avinatan Hassidim. 2010. Cache Replacement Policies for Multicore Processors. In Proc. Innovations in Computer Science (ICS), Andrew Chi-Chih Yao (Ed.). 501--509."},{"key":"e_1_3_2_1_25_1","volume-title":"Online Algorithms, The State of the Art (the book grow out of a Dagstuhl Seminar","author":"Irani Sandy","year":"1996","unstructured":"Sandy Irani. 1996. Competitive Analysis of Paging. In Online Algorithms, The State of the Art (the book grow out of a Dagstuhl Seminar, June 1996) (Lecture Notes in Computer Science, Vol. 1442), Amos Fiat and Gerhard J. Woeginger (Eds.). Springer, 52--73."},{"key":"e_1_3_2_1_26_1","volume-title":"Toward Efficient Architecture-Independent Algorithms for Dynamic Programs. In International Conference on High Performance Computing. Springer, 143--164","author":"Javanmard Mohammad Mahdi","year":"2019","unstructured":"Mohammad Mahdi Javanmard, Pramod Ganapathi, Rathish Das, Zafar Ahmad, Stephen Tschudi, and Rezaul Chowdhury. 2019. Toward Efficient Architecture-Independent Algorithms for Dynamic Programs. In International Conference on High Performance Computing. Springer, 143--164."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2012.29"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3126908.3126931"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090246"},{"key":"e_1_3_2_1_30_1","volume-title":"Handbook of Scheduling - Algorithms, Models, and Performance Analysis, Joseph Y.-T","author":"Pruhs Kirk","unstructured":"Kirk Pruhs, Jir\u00ed Sgall, and Eric Torng. 2004. Online Scheduling. In Handbook of Scheduling - Algorithms, Models, and Performance Analysis, Joseph Y.-T. Leung (Ed.). Chapman and Hall\/CRC."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/762350.762353"},{"key":"e_1_3_2_1_32_1","volume-title":"Experimental Design of Work Chunking for Graph Algorithms on High Bandwidth Memory Architectures. In 2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE, 875--884","author":"Slota George M","year":"2018","unstructured":"George M Slota and Siva Rajamanickam. 2018. Experimental Design of Work Chunking for Graph Algorithms on High Bandwidth Memory Architectures. In 2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE, 875--884."},{"key":"e_1_3_2_1_33_1","volume-title":"The Free Encyclopedia. https:\/\/en.wikipedia.org\/w\/index.php?title=High_Bandwidth_Memory&oldid=1272614625 [Online","author":"Wikipedia","year":"2025","unstructured":"Wikipedia contributors. 2025. High Bandwidth Memory --- Wikipedia, The Free Encyclopedia. https:\/\/en.wikipedia.org\/w\/index.php?title=High_Bandwidth_Memory&oldid=1272614625 [Online; accessed 15-February-2025]."}],"event":{"name":"SPAA '25: 37th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Portland OR USA","acronym":"SPAA '25","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 37th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3694906.3743336","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3694906.3743336","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T19:18:40Z","timestamp":1777922320000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3694906.3743336"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,16]]},"references-count":33,"alternative-id":["10.1145\/3694906.3743336","10.1145\/3694906"],"URL":"https:\/\/doi.org\/10.1145\/3694906.3743336","relation":{},"subject":[],"published":{"date-parts":[[2025,7,16]]},"assertion":[{"value":"2025-07-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}