Giuseppe Bilotta , Vito Zago , Alexis Hérault , Annalisa Cappello , Gaetana Ganci , Hendrik D. van Ettinger , Robert A. Dalrymple
{"title":"在 GPU 上优化平滑粒子流体力学中的灵活邻域列表","authors":"Giuseppe Bilotta , Vito Zago , Alexis Hérault , Annalisa Cappello , Gaetana Ganci , Hendrik D. van Ettinger , Robert A. Dalrymple","doi":"10.1016/j.advengsoft.2024.103711","DOIUrl":null,"url":null,"abstract":"<div><p>Recent refactoring of the GPUSPH codebase have uncovered some of the limitations of the official CUDA compiler (<span>nvcc</span>) offered by NVIDIA when dealing with some C++ constructs, which has shed some new light on the relative importance of the neighbors list construction and traversal in SPH codes, presenting new possibility of optimization with surprising performance gains. We present our solution for high-performance neighbors list construction and traversal, and show that a <span><math><mrow><mn>4</mn><mo>×</mo></mrow></math></span> speedup can be achieved in industrial applications.</p></div>","PeriodicalId":50866,"journal":{"name":"Advances in Engineering Software","volume":"196 ","pages":"Article 103711"},"PeriodicalIF":4.0000,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0965997824001182/pdfft?md5=50c20d5ae7d4d324220dfbb35b9727fe&pid=1-s2.0-S0965997824001182-main.pdf","citationCount":"0","resultStr":"{\"title\":\"Optimization of flexible neighbors lists in Smoothed Particle Hydrodynamics on GPU\",\"authors\":\"Giuseppe Bilotta , Vito Zago , Alexis Hérault , Annalisa Cappello , Gaetana Ganci , Hendrik D. van Ettinger , Robert A. Dalrymple\",\"doi\":\"10.1016/j.advengsoft.2024.103711\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Recent refactoring of the GPUSPH codebase have uncovered some of the limitations of the official CUDA compiler (<span>nvcc</span>) offered by NVIDIA when dealing with some C++ constructs, which has shed some new light on the relative importance of the neighbors list construction and traversal in SPH codes, presenting new possibility of optimization with surprising performance gains. We present our solution for high-performance neighbors list construction and traversal, and show that a <span><math><mrow><mn>4</mn><mo>×</mo></mrow></math></span> speedup can be achieved in industrial applications.</p></div>\",\"PeriodicalId\":50866,\"journal\":{\"name\":\"Advances in Engineering Software\",\"volume\":\"196 \",\"pages\":\"Article 103711\"},\"PeriodicalIF\":4.0000,\"publicationDate\":\"2024-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S0965997824001182/pdfft?md5=50c20d5ae7d4d324220dfbb35b9727fe&pid=1-s2.0-S0965997824001182-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Advances in Engineering Software\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0965997824001182\",\"RegionNum\":2,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advances in Engineering Software","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0965997824001182","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
摘要
最近对 GPUSPH 代码库进行的重构发现了英伟达公司提供的官方 CUDA 编译器(nvcc)在处理某些 C++ 结构时存在的一些局限性,从而揭示了 SPH 代码中邻接表构建和遍历的相对重要性,为优化提供了新的可能性,并带来了惊人的性能提升。我们介绍了高性能邻接表构建和遍历的解决方案,并表明在工业应用中可以实现 4 倍的速度提升。
Optimization of flexible neighbors lists in Smoothed Particle Hydrodynamics on GPU
Recent refactoring of the GPUSPH codebase have uncovered some of the limitations of the official CUDA compiler (nvcc) offered by NVIDIA when dealing with some C++ constructs, which has shed some new light on the relative importance of the neighbors list construction and traversal in SPH codes, presenting new possibility of optimization with surprising performance gains. We present our solution for high-performance neighbors list construction and traversal, and show that a speedup can be achieved in industrial applications.
期刊介绍:
The objective of this journal is to communicate recent and projected advances in computer-based engineering techniques. The fields covered include mechanical, aerospace, civil and environmental engineering, with an emphasis on research and development leading to practical problem-solving.
The scope of the journal includes:
• Innovative computational strategies and numerical algorithms for large-scale engineering problems
• Analysis and simulation techniques and systems
• Model and mesh generation
• Control of the accuracy, stability and efficiency of computational process
• Exploitation of new computing environments (eg distributed hetergeneous and collaborative computing)
• Advanced visualization techniques, virtual environments and prototyping
• Applications of AI, knowledge-based systems, computational intelligence, including fuzzy logic, neural networks and evolutionary computations
• Application of object-oriented technology to engineering problems
• Intelligent human computer interfaces
• Design automation, multidisciplinary design and optimization
• CAD, CAE and integrated process and product development systems
• Quality and reliability.