{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:32:00Z","timestamp":1760711520629,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,20]]},"DOI":"10.1145\/3731545.3743645","type":"proceedings-article","created":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T12:46:16Z","timestamp":1757421976000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Can Large Language Models Predict Parallel Code Performance?"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5009-0839","authenticated-orcid":false,"given":"Gregory","family":"Bolet","sequence":"first","affiliation":[{"name":"Virginia Tech, Blacksburg, Virginia, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6542-3555","authenticated-orcid":false,"given":"Giorgis","family":"Georgakoudis","sequence":"additional","affiliation":[{"name":"Lawrence Livermore National Laboratory, Livermore, California, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4707-9580","authenticated-orcid":false,"given":"Harshitha","family":"Menon","sequence":"additional","affiliation":[{"name":"Lawrence Livermore National Laboratory, Livermore, California, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8258-9693","authenticated-orcid":false,"given":"Konstantinos","family":"Parasyris","sequence":"additional","affiliation":[{"name":"Lawrence Livermore National Lab, Livermore, California, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-4010-7213","authenticated-orcid":false,"given":"Niranjan","family":"Hasabnis","sequence":"additional","affiliation":[{"name":"Code Metal, Boston, Massachusetts, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3419-2632","authenticated-orcid":false,"given":"Hayden","family":"Estes","sequence":"additional","affiliation":[{"name":"Virginia Tech, Blacksburg, Virginia, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1679-5448","authenticated-orcid":false,"given":"Kirk","family":"Cameron","sequence":"additional","affiliation":[{"name":"Virginia Tech, Blacksburg, Virginia, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8831-5423","authenticated-orcid":false,"given":"Gal","family":"Oren","sequence":"additional","affiliation":[{"name":"Technion, Stanford University, Stanford, California, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,9,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISPA-BDCloud-SocialCom-SustainCom51426.2020.00149"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/compsac61105.2024.00278"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293883.3302577"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/hpec58863.2023.10363534"},{"key":"e_1_3_2_1_5_1","unstructured":"Gregory Bolet. 2025. LLMs4Roofline Performance Prediction. https:\/\/github.com\/Scientific-Computing-Lab\/ParallelCodeEstimation."},{"key":"e_1_3_2_1_6_1","volume-title":"Do Large Language Models Understand Performance Optimization?","author":"Cui Bowen","year":"2025","unstructured":"Bowen Cui, Tejas Ramesh, Oscar Hernandez, and Keren Zhou. 2025. Do Large Language Models Understand Performance Optimization? (2025). arXiv:2503.13772 [cs.DC] https:\/\/arxiv.org\/abs\/2503.13772"},{"key":"e_1_3_2_1_7_1","unstructured":"Mark Chen and et al. 2021. Evaluating Large Language Models Trained on Code. arXiv:2107.03374 [cs.LG]"},{"key":"e_1_3_2_1_8_1","unstructured":"Ru Chen Jingwei Shen and Xiao He. 2024. A Model Is Not Built By A Single Prompt: LLM-Based Domain Modeling With Question Decomposition. arXiv:2410.09854 [cs.SE] https:\/\/arxiv.org\/abs\/2410.09854"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/979-8-8688-0318-5_7"},{"key":"e_1_3_2_1_10_1","unstructured":"Microsoft Corporation. 2025. Azure OpenAI Service documentation - Quickstarts Tutorials API Reference - Azure AI services \u2014 learn.microsoft.com. https:\/\/learn.microsoft.com\/en-us\/azure\/ai-services\/openai\/. [Accessed 11-04-2025]."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.23919\/isc.2024.10528929"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","unstructured":"Daniel Nichols Pranav Polasam Harshitha Menon Aniruddha Marathe T. Gamblin and A. Bhatele. 2024. Performance-Aligned LLMs for Generating Fast Code. arXiv.org (2024). 10.48550\/arxiv.2404.18864","DOI":"10.48550\/arxiv.2404.18864"},{"key":"e_1_3_2_1_13_1","unstructured":"Dheeru Dua Shivanshu Gupta Sameer Singh and Matt Gardner. 2022. Successive Prompting for Decomposing Complex Questions. arXiv:2212.04092 [cs.CL] https:\/\/arxiv.org\/abs\/2212.04092"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3337821.3337833"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/bdcloud.2018.00139"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2951218"},{"key":"e_1_3_2_1_17_1","unstructured":"Zheming Jin. 2024. HeCBench. https:\/\/github.com\/zjin-lcf\/HeCBench."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS57527.2023.00041"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/iiswc63097.2024.00016"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.1553"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.48550\/arxiv.2402.02018"},{"key":"e_1_3_2_1_22_1","unstructured":"Nelson F. Liu Kevin Lin John Hewitt Ashwin Paranjape Michele Bevilacqua Fabio Petroni and Percy Liang. 2023. Lost in the Middle: How Language Models Use Long Contexts. arXiv:2307.03172 [cs.CL] https:\/\/arxiv.org\/abs\/2307.03172"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3431731"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/mascots64422.2024.10786558"},{"key":"e_1_3_2_1_25_1","unstructured":"Sundar Pichai Demis Hassabis and Koray Kavukcuoglu. 2024. Introducing Gemini 2.0: our new AI model for the agentic era \u2014 blog.google. https:\/\/blog.google\/technology\/google-deepmind\/google-gemini-ai-update-december-2024\/. [Accessed 11-04-2025]."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2024.findings-emnlp.432"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3669940.3707265"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3097283"},{"key":"e_1_3_2_1_29_1","unstructured":"Yu Wang and et al. 2023. LLM-OMP: Automated OpenMP Parallelization Using Large Language Models. arXiv preprint arXiv:2308.02744 (2023)."},{"key":"e_1_3_2_1_30_1","volume-title":"Oh (Eds.)","volume":"35","author":"Wei Jason","year":"2022","unstructured":"Jason Wei, Xuezhi Wang, Dale Schuurmans, Maarten Bosma, brian ichter, Fei Xia, Ed Chi, Quoc V Le, and Denny Zhou. 2022. Chain-of-Thought Prompting Elicits Reasoning in Large Language Models. In Advances in Neural Information Processing Systems, S. Koyejo, S. Mohamed, A. Agarwal, D. Belgrave, K. Cho, and A. Oh (Eds.), Vol. 35. Curran Associates, Inc., 24824\u201324837. https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2022\/file\/9d5609613524ecf4f15af0f7b31abca4-Paper-Conference.pdf"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498765.1498785"},{"key":"e_1_3_2_1_32_1","unstructured":"Frank Xu and et al. 2022. Systematic Evaluation of Large Language Models for Code. arXiv preprint arXiv:2202.13169 (2022)."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/P3HPC.2018.00005"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.5547"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-17248-4_7"},{"key":"e_1_3_2_1_36_1","volume-title":"Chi","author":"Zhou Denny","year":"2023","unstructured":"Denny Zhou, Nathanael Sch\u00e4rli, Le Hou, Jason Wei, Nathan Scales, Xuezhi Wang, Dale Schuurmans, Claire Cui, Olivier Bousquet, Quoc Le, and Ed Chi. 2023. Least-to-Most Prompting Enables Complex Reasoning in Large Language Models. arXiv:2205.10625 [cs.AI] https:\/\/arxiv.org\/abs\/2205.10625"}],"event":{"name":"HPDC '25: 34th International Symposium on High-Performance Parallel and Distributed Computing","location":"University of Notre Dame Conference Facilities Notre Dame IN USA","acronym":"HPDC '25","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the 34th International Symposium on High-Performance Parallel and Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3731545.3743645","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T12:47:21Z","timestamp":1757422041000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3731545.3743645"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,20]]},"references-count":36,"alternative-id":["10.1145\/3731545.3743645","10.1145\/3731545"],"URL":"https:\/\/doi.org\/10.1145\/3731545.3743645","relation":{},"subject":[],"published":{"date-parts":[[2025,7,20]]},"assertion":[{"value":"2025-09-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}