作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2012, Vol. 38 ›› Issue (12): 26-28. doi: 10.3969/j.issn.1000-3428.2012.12.007

• 软件技术与数据库 • 上一篇    下一篇

基于KDC树的高阶相关函数计算

陈 松,于 策,孙济洲,孙 超   

  1. (天津大学计算机科学与技术学院,天津 300072)
  • 收稿日期:2011-11-03 出版日期:2012-06-20 发布日期:2012-06-20
  • 作者简介:陈 松(1988-),男,硕士研究生,主研方向:并行计算,分布式计算;于 策(通讯作者),讲师;孙济洲,教授、博士生导师;孙 超,硕士研究生
  • 基金资助:
    国家自然科学基金资助项目(10978016, 11003027);天津市科技支撑计划基金资助重点项目(09ZCKFGX00400, 11ZCKFGX 01000)

High-order Correlation Function Calculation Based on KDC-tree

CHEN Song, YU Ce, SUN Ji-zhou, SUN Chao   

  1. (School of Computer Science and Technology, Tianjin University, Tianjin 300072, China)
  • Received:2011-11-03 Online:2012-06-20 Published:2012-06-20

摘要: 高阶相关函数的计算复杂度随维度增加呈指数增长。为此,提出一种改进的高阶相关函数计算方法。在KDC树的数据结构基础上,设计剪枝搜索算法。针对三点相关函数给出该算法的具体实现,利用多线程并行技术对其进行加速,从而优化高阶相关函数的计算。实验结果验证了该方法的正确性和有效性。

关键词: 相关函数, KDC树结构, 剪枝算法, 并行计算, 天文计算, 高性能计算

Abstract: The complexity of higher order correlation function increases exponentially with the growth of the dimension. An improved high-order correlation function calculation method is presented in this paper. A new pruning research algorithm based on the KDC-tree data structure is designed. The implementation of three points correlation function is given, and it is accelerated with parallel technology to optimize the calculation of high-order correlation function. Experimental results validate the correctness and efficiency of this method.

Key words: correlation function, KDC-tree structure, pruning algorithm, parallel calculation, astronomical calculation, high performance calculation

中图分类号: