{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T23:45:53Z","timestamp":1783035953808,"version":"3.54.6"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,11,11]],"date-time":"2023-11-11T00:00:00Z","timestamp":1699660800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Ministerio de Ciencia e Innovaci\u00f3n","award":["PID2019-104184RB-I00"],"award-info":[{"award-number":["PID2019-104184RB-I00"]}]},{"name":"Ministerio de Educaci\u00f3n y Formaci\u00f3n Profesional","award":["FPU19\/03974"],"award-info":[{"award-number":["FPU19\/03974"]}]},{"DOI":"10.13039\/501100010801","name":"Xunta de Galicia","doi-asserted-by":"publisher","award":["ED431C 2021\/30"],"award-info":[{"award-number":["ED431C 2021\/30"]}],"id":[{"id":"10.13039\/501100010801","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010801","name":"Xunta de Galicia","doi-asserted-by":"publisher","award":["ED431G 2019\/01"],"award-info":[{"award-number":["ED431G 2019\/01"]}],"id":[{"id":"10.13039\/501100010801","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,11,12]]},"DOI":"10.1145\/3581784.3607087","type":"proceedings-article","created":{"date-parts":[[2023,11,14]],"date-time":"2023-11-14T21:47:06Z","timestamp":1699998426000},"page":"1-14","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":23,"title":["VENOM: A Vectorized N:M Format for Unleashing the Power of Sparse Tensor Cores"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0001-5493-0287","authenticated-orcid":false,"given":"Roberto L.","family":"Castro","sequence":"first","affiliation":[{"name":"CITIC, Universidade da Coru\u00f1a, A Coru\u00f1a, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0009-0007-9487-9990","authenticated-orcid":false,"given":"Andrei","family":"Ivanov","sequence":"additional","affiliation":[{"name":"Department of Computer Science, ETH Z\u00fcrich, Z\u00fcrich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0001-5670-7425","authenticated-orcid":false,"given":"Diego","family":"Andrade","sequence":"additional","affiliation":[{"name":"CITIC, Universidade da Coru\u00f1a, A Coru\u00f1a, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-3657-6568","authenticated-orcid":false,"given":"Tal","family":"Ben-Nun","sequence":"additional","affiliation":[{"name":"Department of Computer Science, ETH Z\u00fcrich, Z\u00fcrich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-3438-5960","authenticated-orcid":false,"given":"Basilio B.","family":"Fraguela","sequence":"additional","affiliation":[{"name":"CITIC, Universidade da Coru\u00f1a, A Coru\u00f1a, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-1333-9797","authenticated-orcid":false,"given":"Torsten","family":"Hoefler","sequence":"additional","affiliation":[{"name":"Department of Computer Science, ETH Z\u00fcrich, Z\u00fcrich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,11,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/3495724.3495883"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3559009.3569691"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3458817.3476182"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3572848.3577500"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/n19-1423"},{"key":"e_1_3_2_1_6_1","unstructured":"Elias Frantar and Dan Alistarh. 2023. SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot. arXiv:2301.00774 [cs.LG]  Elias Frantar and Dan Alistarh. 2023. SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot. arXiv:2301.00774 [cs.LG]"},{"key":"e_1_3_2_1_7_1","unstructured":"Elias Frantar Eldar Kurtic and Dan Alistarh. 2021. M-FAC: Efficient Matrix-Free Approximations of Second-Order Information. arXiv:2107.03356 [cs.LG]  Elias Frantar Eldar Kurtic and Dan Alistarh. 2021. M-FAC: Efficient Matrix-Free Approximations of Second-Order Information. arXiv:2107.03356 [cs.LG]"},{"key":"e_1_3_2_1_8_1","unstructured":"Trevor Gale Erich Elsen and Sara Hooker. 2019. The State of Sparsity in Deep Neural Networks. arXiv:1902.09574 [cs.LG]  Trevor Gale Erich Elsen and Sara Hooker. 2019. The State of Sparsity in Deep Neural Networks. arXiv:1902.09574 [cs.LG]"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/3433701.3433723"},{"key":"e_1_3_2_1_10_1","volume-title":"Retrieved","author":"Research Google","year":"2020","unstructured":"Google Research . 2020 . Deep Learning Matrix Collection . Retrieved March 26, 2023 from https:\/\/2.zoppoz.workers.dev:443\/https\/github.com\/google-research\/google-research\/tree\/master\/sgk Google Research. 2020. Deep Learning Matrix Collection. Retrieved March 26, 2023 from https:\/\/2.zoppoz.workers.dev:443\/https\/github.com\/google-research\/google-research\/tree\/master\/sgk"},{"key":"e_1_3_2_1_11_1","volume-title":"Dally","author":"Han Song","year":"2016","unstructured":"Song Han , Huizi Mao , and William J . Dally . 2016 . Deep Compression : Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Coding . arXiv:1510.00149 [cs.CV] Song Han, Huizi Mao, and William J. Dally. 2016. Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Coding. arXiv:1510.00149 [cs.CV]"},{"key":"e_1_3_2_1_12_1","volume-title":"Yang Yang, and Yanqi Zhou.","author":"Hestness Joel","year":"2017","unstructured":"Joel Hestness , Sharan Narang , Newsha Ardalani , Gregory Diamos , Heewoo Jun , Hassan Kianinejad , Md. Mostofa Ali Patwary , Yang Yang, and Yanqi Zhou. 2017 . Deep Learning Scaling is Predictable, Empirically . arXiv:1712.00409 [cs.LG] Joel Hestness, Sharan Narang, Newsha Ardalani, Gregory Diamos, Heewoo Jun, Hassan Kianinejad, Md. Mostofa Ali Patwary, Yang Yang, and Yanqi Zhou. 2017. Deep Learning Scaling is Predictable, Empirically. arXiv:1712.00409 [cs.LG]"},{"key":"e_1_3_2_1_13_1","article-title":"Sparsity in Deep Learning: Pruning and Growth for Efficient Inference and Training in Neural Networks","volume":"22","author":"Hoefler Torsten","year":"2021","unstructured":"Torsten Hoefler , Dan Alistarh , Tal Ben-Nun , Nikoli Dryden , and Alexandra Peste . 2021 . Sparsity in Deep Learning: Pruning and Growth for Efficient Inference and Training in Neural Networks . J. Mach. Learn. Res. 22 , 1, Article 241 (jan 2021), 124 pages. Torsten Hoefler, Dan Alistarh, Tal Ben-Nun, Nikoli Dryden, and Alexandra Peste. 2021. Sparsity in Deep Learning: Pruning and Growth for Efficient Inference and Training in Neural Networks. J. Mach. Learn. Res. 22, 1, Article 241 (jan 2021), 124 pages.","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_3_2_1_14_1","unstructured":"Andrei Ivanov Nikoli Dryden Tal Ben-Nun Saleh Ashkboos and Torsten Hoefler. 2023. STen: Productive and Efficient Sparsity in PyTorch. arXiv:2304.07613 [cs.LG]  Andrei Ivanov Nikoli Dryden Tal Ben-Nun Saleh Ashkboos and Torsten Hoefler. 2023. STen: Productive and Efficient Sparsity in PyTorch. arXiv:2304.07613 [cs.LG]"},{"key":"e_1_3_2_1_15_1","volume-title":"Proceedings of Machine Learning and Systems, A. Smola, A. Dimakis, and I. Stoica (Eds.)","volume":"3","author":"Ivanov Andrei","year":"2021","unstructured":"Andrei Ivanov , Nikoli Dryden , Tal Ben-Nun , Shigang Li , and Torsten Hoefler . 2021 . Data Movement Is All You Need: A Case Study on Optimizing Transformers . In Proceedings of Machine Learning and Systems, A. Smola, A. Dimakis, and I. Stoica (Eds.) , Vol. 3 . San Jose, CA, USA, 711--732. Andrei Ivanov, Nikoli Dryden, Tal Ben-Nun, Shigang Li, and Torsten Hoefler. 2021. Data Movement Is All You Need: A Case Study on Optimizing Transformers. In Proceedings of Machine Learning and Systems, A. Smola, A. Dimakis, and I. Stoica (Eds.), Vol. 3. San Jose, CA, USA, 711--732."},{"key":"e_1_3_2_1_16_1","unstructured":"Jared Kaplan Sam McCandlish Tom Henighan Tom B. Brown Benjamin Chess Rewon Child Scott Gray Alec Radford Jeffrey Wu and Dario Amodei. 2020. Scaling Laws for Neural Language Models. arXiv:2001.08361 [cs.LG]  Jared Kaplan Sam McCandlish Tom Henighan Tom B. Brown Benjamin Chess Rewon Child Scott Gray Alec Radford Jeffrey Wu and Dario Amodei. 2020. Scaling Laws for Neural Language Models. arXiv:2001.08361 [cs.LG]"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Olga Kovaleva Saurabh Kulshreshtha Anna Rogers and Anna Rumshisky. 2021. BERT Busters: Outlier Dimensions that Disrupt Transformers. arXiv:2105.06990 [cs.CL]  Olga Kovaleva Saurabh Kulshreshtha Anna Rogers and Anna Rumshisky. 2021. BERT Busters: Outlier Dimensions that Disrupt Transformers. arXiv:2105.06990 [cs.CL]","DOI":"10.18653\/v1\/2021.findings-acl.300"},{"key":"e_1_3_2_1_18_1","unstructured":"Eldar Kurtic and Dan Alistarh. 2022. GMP*: Well-Tuned Gradual Magnitude Pruning Can Outperform Most BERT-Pruning Methods. arXiv:2210.06384 [cs.CL]  Eldar Kurtic and Dan Alistarh. 2022. GMP*: Well-Tuned Gradual Magnitude Pruning Can Outperform Most BERT-Pruning Methods. arXiv:2210.06384 [cs.CL]"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Eldar Kurtic Daniel Campos Tuan Nguyen Elias Frantar Mark Kurtz Benjamin Fineran Michael Goin and Dan Alistarh. 2022. The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Models. arXiv:2203.07259 [cs.CL]  Eldar Kurtic Daniel Campos Tuan Nguyen Elias Frantar Mark Kurtz Benjamin Fineran Michael Goin and Dan Alistarh. 2022. The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Models. arXiv:2203.07259 [cs.CL]","DOI":"10.18653\/v1\/2022.emnlp-main.279"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Fran\u00e7ois Lagunas Ella Charlaix Victor Sanh and Alexander M Rush. 2021. Block Pruning For Faster Transformers. arXiv:2109.04838 [cs.LG]  Fran\u00e7ois Lagunas Ella Charlaix Victor Sanh and Alexander M Rush. 2021. Block Pruning For Faster Transformers. arXiv:2109.04838 [cs.LG]","DOI":"10.18653\/v1\/2021.emnlp-main.829"},{"key":"e_1_3_2_1_21_1","volume-title":"Proceedings of Neural Information Processing Systems (NIPS'89)","volume":"2","author":"LeCun Yann","year":"1989","unstructured":"Yann LeCun , John Denker , and Sara Solla . 1989 . Optimal Brain Damage . In Proceedings of Neural Information Processing Systems (NIPS'89) , D. Touretzky (Ed.) , Vol. 2 . Morgan-Kaufmann, Denver, Colorado. Yann LeCun, John Denker, and Sara Solla. 1989. Optimal Brain Damage. In Proceedings of Neural Information Processing Systems (NIPS'89), D. Touretzky (Ed.), Vol. 2. Morgan-Kaufmann, Denver, Colorado."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/3408352.3408370"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/3571885.3571934"},{"key":"e_1_3_2_1_24_1","volume-title":"Proceedings of Neural Information Processing Systems (NIPS'19)","volume":"32","author":"Michel Paul","year":"2019","unstructured":"Paul Michel , Omer Levy , and Graham Neubig . 2019 . Are Sixteen Heads Really Better than One? . In Proceedings of Neural Information Processing Systems (NIPS'19) , H. Wallach, H. Larochelle, A. Beygelzimer, F. d'Alch\u00e9-Buc, E. Fox, and R. Garnett (Eds.) , Vol. 32 . Curran Associates, Inc., Vancouver, Canada. Paul Michel, Omer Levy, and Graham Neubig. 2019. Are Sixteen Heads Really Better than One?. In Proceedings of Neural Information Processing Systems (NIPS'19), H. Wallach, H. Larochelle, A. Beygelzimer, F. d'Alch\u00e9-Buc, E. Fox, and R. Garnett (Eds.), Vol. 32. Curran Associates, Inc., Vancouver, Canada."},{"key":"e_1_3_2_1_25_1","volume-title":"Jeff Pool, Darko Stosic, Dusan Stosic, Ganesh Venkatesh, Chong Yu, and Paulius Micikevicius.","author":"Mishra Asit","year":"2021","unstructured":"Asit Mishra , Jorge Albericio Latorre , Jeff Pool, Darko Stosic, Dusan Stosic, Ganesh Venkatesh, Chong Yu, and Paulius Micikevicius. 2021 . Accelerating Sparse Deep Neural Networks . arXiv:2104.08378 [cs.LG] Asit Mishra, Jorge Albericio Latorre, Jeff Pool, Darko Stosic, Dusan Stosic, Ganesh Venkatesh, Chong Yu, and Paulius Micikevicius. 2021. Accelerating Sparse Deep Neural Networks. arXiv:2104.08378 [cs.LG]"},{"key":"e_1_3_2_1_26_1","volume-title":"Retrieved","author":"NVIDIA.","year":"2020","unstructured":"NVIDIA. 2020 . Exploiting NVIDIA Ampere Structured Sparsity with cuSPARSELt . Retrieved March 26, 2023 from https:\/\/2.zoppoz.workers.dev:443\/https\/developer.nvidia.com\/blog\/exploiting-ampere-structured-sparsity-with-cusparselt\/ NVIDIA. 2020. Exploiting NVIDIA Ampere Structured Sparsity with cuSPARSELt. Retrieved March 26, 2023 from https:\/\/2.zoppoz.workers.dev:443\/https\/developer.nvidia.com\/blog\/exploiting-ampere-structured-sparsity-with-cusparselt\/"},{"key":"e_1_3_2_1_27_1","volume-title":"Retrieved","author":"NVIDIA.","year":"2023","unstructured":"NVIDIA. 2023 . The cuSparse Library . Retrieved March 26, 2023 from https:\/\/2.zoppoz.workers.dev:443\/https\/docs.nvidia.com\/cuda\/cusparse\/index.html NVIDIA. 2023. The cuSparse Library. Retrieved March 26, 2023 from https:\/\/2.zoppoz.workers.dev:443\/https\/docs.nvidia.com\/cuda\/cusparse\/index.html"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/331532.331562"},{"key":"e_1_3_2_1_29_1","volume-title":"Proceedings of Neural Information Processing Systems (NIPS'21)","volume":"34","author":"Pool Jeff","year":"2021","unstructured":"Jeff Pool and Chong Yu . 2021 . Channel Permutations for N:M Sparsity . In Proceedings of Neural Information Processing Systems (NIPS'21) , M. Ranzato, A. Beygelzimer, Y. Dauphin, P.S. Liang, and J. Wortman Vaughan (Eds.) , Vol. 34 . Curran Associates, Inc., Virtual-only Conference, 13316--13327. Jeff Pool and Chong Yu. 2021. Channel Permutations for N:M Sparsity. In Proceedings of Neural Information Processing Systems (NIPS'21), M. Ranzato, A. Beygelzimer, Y. Dauphin, P.S. Liang, and J. Wortman Vaughan (Eds.), Vol. 34. Curran Associates, Inc., Virtual-only Conference, 13316--13327."},{"key":"e_1_3_2_1_30_1","unstructured":"Alec Radford Jeffrey Wu Rewon Child David Luan Dario Amodei Ilya Sutskever etal 2019. Language models are unsupervised multitask learners. OpenAI blog 1 8 (2019) 9.  Alec Radford Jeffrey Wu Rewon Child David Luan Dario Amodei Ilya Sutskever et al. 2019. Language models are unsupervised multitask learners. OpenAI blog 1 8 (2019) 9."},{"key":"e_1_3_2_1_31_1","volume-title":"Proceedings of Neural Information Processing Systems (NIPS'20)","author":"Sanh Victor","year":"2020","unstructured":"Victor Sanh , Thomas Wolf , and Alexander Rush . 2020 . Movement pruning: Adaptive sparsity by fine-tuning . Proceedings of Neural Information Processing Systems (NIPS'20) 33 (2020), 20378--20389. Victor Sanh, Thomas Wolf, and Alexander Rush. 2020. Movement pruning: Adaptive sparsity by fine-tuning. Proceedings of Neural Information Processing Systems (NIPS'20) 33 (2020), 20378--20389."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P19-1355"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/tpds.2022.3217824"},{"key":"e_1_3_2_1_34_1","volume-title":"Proceedings of Neural Information Processing Systems (NIPS'17)","volume":"30","author":"Vaswani Ashish","year":"2017","unstructured":"Ashish Vaswani , Noam Shazeer , Niki Parmar , Jakob Uszkoreit , Llion Jones , Aidan N Gomez , \u0141 ukasz Kaiser, and Illia Polosukhin . 2017 . Attention is All you Need . In Proceedings of Neural Information Processing Systems (NIPS'17) , I. Guyon, U. Von Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett (Eds.) , Vol. 30 . Curran Associates, Inc., Long Beach, CA, USA. https:\/\/2.zoppoz.workers.dev:443\/https\/proceedings.neurips.cc\/paper_files\/paper\/2017\/file\/3f5ee243547dee91fbd053c1c4a845aa-Paper.pdf Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, \u0141 ukasz Kaiser, and Illia Polosukhin. 2017. Attention is All you Need. In Proceedings of Neural Information Processing Systems (NIPS'17), I. Guyon, U. Von Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett (Eds.), Vol. 30. Curran Associates, Inc., Long Beach, CA, USA. https:\/\/2.zoppoz.workers.dev:443\/https\/proceedings.neurips.cc\/paper_files\/paper\/2017\/file\/3f5ee243547dee91fbd053c1c4a845aa-Paper.pdf"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Elena Voita David Talbot Fedor Moiseev Rico Sennrich and Ivan Titov. 2019. Analyzing Multi-Head Self-Attention: Specialized Heads Do the Heavy Lifting the Rest Can Be Pruned. arXiv:1905.09418 [cs.CL]  Elena Voita David Talbot Fedor Moiseev Rico Sennrich and Ivan Titov. 2019. Analyzing Multi-Head Self-Attention: Specialized Heads Do the Heavy Lifting the Rest Can Be Pruned. arXiv:1905.09418 [cs.CL]","DOI":"10.18653\/v1\/P19-1580"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-main.496"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS47924.2020.00071"},{"key":"e_1_3_2_1_38_1","volume-title":"Proceedings of the 39th International Conference on Machine Learning (Proceedings of Machine Learning Research","volume":"26823","author":"Zhang Qingru","year":"2022","unstructured":"Qingru Zhang , Simiao Zuo , Chen Liang , Alexander Bukharin , Pengcheng He , Weizhu Chen , and Tuo Zhao . 2022 . PLATON: Pruning Large Transformer Models with Upper Confidence Bound of Weight Importance . In Proceedings of the 39th International Conference on Machine Learning (Proceedings of Machine Learning Research , Vol. 162), Kamalika Chaudhuri, Stefanie Jegelka, Le Song, Csaba Szepesvari, Gang Niu, and Sivan Sabato (Eds.). PMLR, Baltimore, Maryland, 26809-- 26823 . Qingru Zhang, Simiao Zuo, Chen Liang, Alexander Bukharin, Pengcheng He, Weizhu Chen, and Tuo Zhao. 2022. PLATON: Pruning Large Transformer Models with Upper Confidence Bound of Weight Importance. In Proceedings of the 39th International Conference on Machine Learning (Proceedings of Machine Learning Research, Vol. 162), Kamalika Chaudhuri, Stefanie Jegelka, Le Song, Csaba Szepesvari, Gang Niu, and Sivan Sabato (Eds.). PMLR, Baltimore, Maryland, 26809--26823."}],"event":{"name":"SC '23: International Conference for High Performance Computing, Networking, Storage and Analysis","location":"Denver CO USA","acronym":"SC '23","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","IEEE CS"]},"container-title":["Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/3581784.3607087","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/dl.acm.org\/doi\/pdf\/10.1145\/3581784.3607087","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:36:23Z","timestamp":1750178183000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/3581784.3607087"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,11]]},"references-count":38,"alternative-id":["10.1145\/3581784.3607087","10.1145\/3581784"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1145\/3581784.3607087","relation":{},"subject":[],"published":{"date-parts":[[2023,11,11]]},"assertion":[{"value":"2023-11-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}