计算量子化学中男生函数评价的GPU加速

IF 2.2 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Concurrency and Computation-Practice & Experience Pub Date : 2024-11-19 DOI:10.1002/cpe.8328
Satoki Tsuji, Yasuaki Ito, Koji Nakano, Akihiko Kasagi
{"title":"计算量子化学中男生函数评价的GPU加速","authors":"Satoki Tsuji,&nbsp;Yasuaki Ito,&nbsp;Koji Nakano,&nbsp;Akihiko Kasagi","doi":"10.1002/cpe.8328","DOIUrl":null,"url":null,"abstract":"<p>The Boys function, a mathematical integral function, plays a pivotal role and is frequently evaluated in ab initio molecular orbital computations. The main contribution of this paper is to accelerate the bulk evaluation of the Boys function through the effective utilization of GPUs. The proposed GPU implementation addresses GPU-specific programming issues such as warp divergence and coalesced/stride access to global memory, and we employ the optimal numerical evaluation method from four methods based on input values to ensure efficient computation with sufficient accuracy. Moreover, to consider actual computation of molecular integrals, we have implemented and evaluated the proposed method in two scenarios: single evaluation, which computes a single value of the Boys function for a single input, and incremental evaluation, which computes multiple values of the Boys function incrementally. The execution time of the proposed GPU implementation was evaluated for both scenarios using an NVIDIA A100 Tensor Core GPU. As a result, the GPU-accelerated bulk evaluation has achieved a throughput of computing the values of the Boys function <span></span><math>\n <semantics>\n <mrow>\n <mn>17</mn>\n <mo>.</mo>\n <mn>7</mn>\n <mo>×</mo>\n <mn>1</mn>\n <msup>\n <mrow>\n <mn>0</mn>\n </mrow>\n <mrow>\n <mn>9</mn>\n </mrow>\n </msup>\n </mrow>\n <annotation>$$ 17.7\\times 1{0}^9 $$</annotation>\n </semantics></math> times per second for the single evaluation and <span></span><math>\n <semantics>\n <mrow>\n <mn>97</mn>\n <mo>.</mo>\n <mn>7</mn>\n <mo>×</mo>\n <mn>1</mn>\n <msup>\n <mrow>\n <mn>0</mn>\n </mrow>\n <mrow>\n <mn>9</mn>\n </mrow>\n </msup>\n </mrow>\n <annotation>$$ 97.7\\times 1{0}^9 $$</annotation>\n </semantics></math> times per second for the incremental evaluation, respectively. Our parallelized CPU and GPU implementation is available at \nhttps://github.com/sstsuji/Boys-function-GPU-library.</p>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 2","pages":""},"PeriodicalIF":2.2000,"publicationDate":"2024-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/cpe.8328","citationCount":"0","resultStr":"{\"title\":\"GPU Acceleration of the Boys Function Evaluation in Computational Quantum Chemistry\",\"authors\":\"Satoki Tsuji,&nbsp;Yasuaki Ito,&nbsp;Koji Nakano,&nbsp;Akihiko Kasagi\",\"doi\":\"10.1002/cpe.8328\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>The Boys function, a mathematical integral function, plays a pivotal role and is frequently evaluated in ab initio molecular orbital computations. The main contribution of this paper is to accelerate the bulk evaluation of the Boys function through the effective utilization of GPUs. The proposed GPU implementation addresses GPU-specific programming issues such as warp divergence and coalesced/stride access to global memory, and we employ the optimal numerical evaluation method from four methods based on input values to ensure efficient computation with sufficient accuracy. Moreover, to consider actual computation of molecular integrals, we have implemented and evaluated the proposed method in two scenarios: single evaluation, which computes a single value of the Boys function for a single input, and incremental evaluation, which computes multiple values of the Boys function incrementally. The execution time of the proposed GPU implementation was evaluated for both scenarios using an NVIDIA A100 Tensor Core GPU. As a result, the GPU-accelerated bulk evaluation has achieved a throughput of computing the values of the Boys function <span></span><math>\\n <semantics>\\n <mrow>\\n <mn>17</mn>\\n <mo>.</mo>\\n <mn>7</mn>\\n <mo>×</mo>\\n <mn>1</mn>\\n <msup>\\n <mrow>\\n <mn>0</mn>\\n </mrow>\\n <mrow>\\n <mn>9</mn>\\n </mrow>\\n </msup>\\n </mrow>\\n <annotation>$$ 17.7\\\\times 1{0}^9 $$</annotation>\\n </semantics></math> times per second for the single evaluation and <span></span><math>\\n <semantics>\\n <mrow>\\n <mn>97</mn>\\n <mo>.</mo>\\n <mn>7</mn>\\n <mo>×</mo>\\n <mn>1</mn>\\n <msup>\\n <mrow>\\n <mn>0</mn>\\n </mrow>\\n <mrow>\\n <mn>9</mn>\\n </mrow>\\n </msup>\\n </mrow>\\n <annotation>$$ 97.7\\\\times 1{0}^9 $$</annotation>\\n </semantics></math> times per second for the incremental evaluation, respectively. Our parallelized CPU and GPU implementation is available at \\nhttps://github.com/sstsuji/Boys-function-GPU-library.</p>\",\"PeriodicalId\":55214,\"journal\":{\"name\":\"Concurrency and Computation-Practice & Experience\",\"volume\":\"37 2\",\"pages\":\"\"},\"PeriodicalIF\":2.2000,\"publicationDate\":\"2024-11-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://onlinelibrary.wiley.com/doi/epdf/10.1002/cpe.8328\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Concurrency and Computation-Practice & Experience\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/cpe.8328\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.8328","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

摘要

男孩函数是一个数学积分函数,在从头算分子轨道计算中起着关键作用,经常被评估。本文的主要贡献在于通过对gpu的有效利用,加速了Boys函数的批量评估。所提出的GPU实现解决了GPU特定的编程问题,如曲度发散和对全局内存的合并/跨步访问,并采用基于输入值的四种方法中的最优数值评估方法,以确保高效的计算和足够的精度。此外,为了考虑分子积分的实际计算,我们在两种情况下实现并评估了所提出的方法:单次评估,对单个输入计算单个Boys函数值;增量评估,增量计算多个Boys函数值。使用NVIDIA A100 Tensor Core GPU对两种场景的执行时间进行了评估。因此,gpu加速的批量评估实现了计算Boys函数值的吞吐量17。7 × 109 $$ 17.7\times 1{0}^9 $$次/秒的单次评估和97。分别为7 × 10 9 $$ 97.7\times 1{0}^9 $$次/秒的增量计算。我们的并行CPU和GPU实现可在https://github.com/sstsuji/Boys-function-GPU-library。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
GPU Acceleration of the Boys Function Evaluation in Computational Quantum Chemistry

The Boys function, a mathematical integral function, plays a pivotal role and is frequently evaluated in ab initio molecular orbital computations. The main contribution of this paper is to accelerate the bulk evaluation of the Boys function through the effective utilization of GPUs. The proposed GPU implementation addresses GPU-specific programming issues such as warp divergence and coalesced/stride access to global memory, and we employ the optimal numerical evaluation method from four methods based on input values to ensure efficient computation with sufficient accuracy. Moreover, to consider actual computation of molecular integrals, we have implemented and evaluated the proposed method in two scenarios: single evaluation, which computes a single value of the Boys function for a single input, and incremental evaluation, which computes multiple values of the Boys function incrementally. The execution time of the proposed GPU implementation was evaluated for both scenarios using an NVIDIA A100 Tensor Core GPU. As a result, the GPU-accelerated bulk evaluation has achieved a throughput of computing the values of the Boys function 17 . 7 × 1 0 9 $$ 17.7\times 1{0}^9 $$ times per second for the single evaluation and 97 . 7 × 1 0 9 $$ 97.7\times 1{0}^9 $$ times per second for the incremental evaluation, respectively. Our parallelized CPU and GPU implementation is available at https://github.com/sstsuji/Boys-function-GPU-library.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Concurrency and Computation-Practice & Experience
Concurrency and Computation-Practice & Experience 工程技术-计算机:理论方法
CiteScore
5.00
自引率
10.00%
发文量
664
审稿时长
9.6 months
期刊介绍: Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of: Parallel and distributed computing; High-performance computing; Computational and data science; Artificial intelligence and machine learning; Big data applications, algorithms, and systems; Network science; Ontologies and semantics; Security and privacy; Cloud/edge/fog computing; Green computing; and Quantum computing.
期刊最新文献
An Approach to Efficient Reduction of Ethereum's Turing-Completeness UAV Path Planning Based on an Improved Tasmanian Devil Optimization Algorithm FedTLA: Trust-Differentiated Selective Aggregation for Backdoor-Resilient Federated Learning VOHSABE-SC: A Verifiable Outsourced Hierarchical Searchable Attribute-Based Encryption Scheme Supported by Smart Contracts Edge-guided Dual Alignment Framework for Semi-Supervised Scene Change Detection
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1