欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
通信算法需要在相邻子区域间传输数据．通过求解子区域间的相交问题可以寻找相邻区域．针对子区域的求交问题，基于区间树，结合结构网格应用的特点，构造近似线性时间复杂度的算法．数值实验表明该算法具有较高的计算效率和可扩展性，能够支持百万量级矩形子区域的并行计算．
英文摘要：
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.
同期刊论文项目
同项目期刊论文
A New Progressive Algorithm for a Multiple Longest Common Subsequences Problem and Its Efficient Par
A finite element recovery approach to eigenvalue approximations with applications to electronic stru
The preconditioned Jacobian-free Newton-Krylov methods for nonequilibrium radiation diffusion equati
Exploiting fine-grained parallelism in graph traversal algorithms via lock virtualization on multi-c
期刊信息
位置：