Accelerating GPU-Based Parallel FDTD With Advanced Operator Fusion

IF 4.8 2区 计算机科学 Q2 ENGINEERING, ELECTRICAL & ELECTRONIC
Siyi Huang;Yu Cheng;Raj Mittra;Xinyue Zhang;Xingqi Zhang
{"title":"Accelerating GPU-Based Parallel FDTD With Advanced Operator Fusion","authors":"Siyi Huang;Yu Cheng;Raj Mittra;Xinyue Zhang;Xingqi Zhang","doi":"10.1109/LAWP.2025.3577055","DOIUrl":null,"url":null,"abstract":"The finite-difference time-domain (FDTD) method is one of the most widely used methods for solving Maxwell’s equations, but its efficiency is limited by the Courant–Friedrichs–Lewy stability condition. Recent research has extensively explored graphics processing unit (GPU)-based parallel implementations of the FDTD method to enhance computational performance. However, the inherent time-stepping and time-marching nature of the FDTD algorithm leads to frequent kernel launches and low memory efficiency on GPUs, still significantly impacting execution efficiency. This letter proposes a GPU-based FDTD framework enhanced with operator fusion to address this challenge. Within this framework, the FDTD algorithm is represented as a computation graph composed of operators. We classify these operators into different types based on their input and output relationships. Using this type of information, a rule-based strategy is developed to merge the operators into larger computational kernels, effectively enhancing GPU execution efficiency. Simulation results demonstrate that the proposed operator fusion framework does not introduce additional errors while achieving a 4× speedup compared to conventional GPU-based implementations.","PeriodicalId":51059,"journal":{"name":"IEEE Antennas and Wireless Propagation Letters","volume":"24 9","pages":"2914-2918"},"PeriodicalIF":4.8000,"publicationDate":"2025-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Antennas and Wireless Propagation Letters","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/11024191/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

The finite-difference time-domain (FDTD) method is one of the most widely used methods for solving Maxwell’s equations, but its efficiency is limited by the Courant–Friedrichs–Lewy stability condition. Recent research has extensively explored graphics processing unit (GPU)-based parallel implementations of the FDTD method to enhance computational performance. However, the inherent time-stepping and time-marching nature of the FDTD algorithm leads to frequent kernel launches and low memory efficiency on GPUs, still significantly impacting execution efficiency. This letter proposes a GPU-based FDTD framework enhanced with operator fusion to address this challenge. Within this framework, the FDTD algorithm is represented as a computation graph composed of operators. We classify these operators into different types based on their input and output relationships. Using this type of information, a rule-based strategy is developed to merge the operators into larger computational kernels, effectively enhancing GPU execution efficiency. Simulation results demonstrate that the proposed operator fusion framework does not introduce additional errors while achieving a 4× speedup compared to conventional GPU-based implementations.
利用先进算子融合加速基于gpu的并行FDTD
时域有限差分法(FDTD)是求解麦克斯韦方程组最常用的方法之一,但其效率受到Courant-Friedrichs-Lewy稳定性条件的限制。最近的研究广泛探索了基于图形处理单元(GPU)的FDTD方法的并行实现,以提高计算性能。然而,FDTD算法固有的时间步进和时间推进特性导致内核启动频繁,gpu上的内存效率较低,仍然会严重影响执行效率。这封信提出了一个基于gpu的FDTD框架,增强了算子融合来应对这一挑战。在这个框架中,FDTD算法被表示为一个由运算符组成的计算图。我们根据它们的输入和输出关系将这些操作符划分为不同的类型。利用这类信息,开发了一种基于规则的策略,将运算符合并到更大的计算核中,有效地提高了GPU的执行效率。仿真结果表明,与传统的基于gpu的实现相比,所提出的算子融合框架在没有引入额外误差的情况下实现了4倍的加速。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
8.00
自引率
9.50%
发文量
529
审稿时长
1.0 months
期刊介绍: IEEE Antennas and Wireless Propagation Letters (AWP Letters) is devoted to the rapid electronic publication of short manuscripts in the technical areas of Antennas and Wireless Propagation. These are areas of competence for the IEEE Antennas and Propagation Society (AP-S). AWPL aims to be one of the "fastest" journals among IEEE publications. This means that for papers that are eventually accepted, it is intended that an author may expect his or her paper to appear in IEEE Xplore, on average, around two months after submission.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信