计算物理 ›› 2012, Vol. 29 ›› Issue (1): 58-64.

• 论文 • 上一篇    下一篇

面向结构网格并行应用的一类快速通信算法

刘旭, 张爱清, 肖丽, 莫则尧   

  1. 北京应用物理与计算数学研究所高性能计算中心, 北京 100094
  • 收稿日期:2011-03-11 修回日期:2011-08-02 出版日期:2012-01-25 发布日期:2012-01-25
  • 作者简介:刘旭(1981-),男,北京,博士,主要从事并行算法与并行应用软件研究,北京市海淀区丰豪东路2号100094,E-mail:liu_xu@iapcm.ac.cn
  • 基金资助:
    国家自然科学基金重点项目(61033009);国家高技术研究发展计划863(2010AA012302,2010AA012303);国家重点基础研究发展规划973(2011CB309702)资助项目

A Fast Communication Algorithm for Parallel Structured Mesh Applications

LIU Xu, ZHANG Aiqing, XIAO Li, MO Zeyao   

  1. Institute of Applied Physics and Computational Mathematics, Beijing 100094
  • Received:2011-03-11 Revised:2011-08-02 Online:2012-01-25 Published:2012-01-25

摘要: 通信算法需要在相邻子区域间传输数据.通过求解子区域间的相交问题可以寻找相邻区域.针对子区域的求交问题,基于区间树,结合结构网格应用的特点,构造近似线性时间复杂度的算法.数值实验表明该算法具有较高的计算效率和可扩展性,能够支持百万量级矩形子区域的并行计算.

关键词: 并行计算, 结构网格, 快速通信算法, 区间树

Abstract: 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.

Key words: parallel computing, parallel structured mesh application, fast communication algorithm, interval tree

中图分类号: