摘要
通信算法需要在相邻子区域间传输数据.通过求解子区域间的相交问题可以寻找相邻区域.针对子区域的求交问题,基于区间树,结合结构网格应用的特点,构造近似线性时间复杂度的算法.数值实验表明该算法具有较高的计算效率和可扩展性,能够支持百万量级矩形子区域的并行计算.
Communication algorithms need to exchange data between adjacent subdomains. The detection of adjacent subdomains is an import task for communication algorithms, which can be done by solving an intersection problem of boxes. An interval tree algorithm is proposed for intersection problems. Taking advantage of structured mesh applications, it is able to maintain 0 （Nlog N ） time complexity. Numerical experiments show that the algorithm is able to achieve high computational efficiency and good scalability. It supports parallel computing of miUion-box scale.
出处
《计算物理》
EI
CSCD
北大核心
2012年第1期58-64,共7页
Chinese Journal of Computational Physics
基金
国家自然科学基金重点项目(61033009)
国家高技术研究发展计划863(2010AA012302
2010AA012303)
国家重点基础研究发展规划973(2011CB309702)资助项目
关键词
并行计算
结构网格
快速通信算法
区间树
parallel computing
parallel structured mesh application
fast communication algorithm
interval tree
