检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:黄晨希 李家辉 颜辉 钟英[1,2] 卢宇彤 HUANG Chenxi;LI Jiahui;YAN Hui;ZHONG Ying;LU Yutong(School of Computer Science and Engineering,Sun Yat-Sen University,Guangzhou 510006,China;National Supercomputing Center in Guangzhou,Guangzhou 510006,China)
机构地区:[1]中山大学计算机学院,广州510006 [2]国家超级计算广州中心,广州510006
出 处:《计算机科学》2025年第5期101-108,共8页Computer Science
摘 要:基于局部加密网格的格子玻尔兹曼方法(LBM),在大规模的非稳态计算流体力学问题中有着越来越广泛的使用。局部网格加密方法虽然可以有效减少计算量,但是也带来了严重的负载均衡问题。尤其是在大规模并行计算中,负载均衡算法的选择对整体的计算效率有重要的影响。使用自研的LBM程序,简单对比了开源框架Palabos的实现结果,然后探讨了基于局部加密网格格子玻尔兹曼方法的静态负载均衡算法。程序中分别基于全局负载和分层负载,使用贪心算法和空间填充曲线算法实现了多种负载均衡策略,提出了计算节点负载均衡优化,并使用小球绕流算例和DrivAer算例进行测试和比较。根据计算结果可知,基于分层负载策略的性能比基于全局负载策略的性能要好;同时,贪心算法和空间填充曲线算法对比各有优劣,前者有较好的可扩展性,而后者在进程数较少时效率较高;最后,基于分层负载,结合贪心算法和空间填充曲线算法实现了混合算法,在进程数较多时获得了最佳性能。The Lattice Boltzmann method(LBM)with local mesh refinement is widely used in large-scale unsteady computational fluid dynamics problems.Although the local mesh refinement method can effectively reduce the computational workload,it also brings serious load balancing issues.Especially in large-scale parallel computing,the choice of load balancing algorithms has a significant impact on the overall computational efficiency.This paper used a self-developed LBM program to compare the implementations of Palabos and to explore the static load balancing algorithm based on the Lattice Boltzmann method with local mesh refinement.This paper implementes various load balancing strategies based on global load and stratified load,uses greedy algorithms and space-filling curve algorithms,and proposes optimization of the load balancing of computing nodes.It uses the flow around a sphere and the DrivAer case as test cases for testing and comparison.Firstly,the results show the performance based on the stratified load strategy is better than that based on the global load strategy.At the same time,a comparative analysis reveals that the greedy algorithm demostrates superior scalability,whereas the space-filling curve algorithm exhibits higher efficiency when operating with a limited number of process.Finally,based on layered load,a hybrid algorithm is implemented by combining greedy algorithm and space filling curve algorithm,which achieves the best performance when the number of processes is larger.
关 键 词:格子玻尔兹曼方法 负载均衡算法 局部加密网格 并行计算 节点负载均衡
分 类 号:TP319[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49