归约算法统一描述  

Towards Unified Description for Reduction Algorithms

作　　者：熊玉庆[1] 

机构地区：[1]上海应用技术学院计算机系,上海201418

出　　处：《计算机科学》2015年第11期101-103,共3页Computer Science

摘　　要：归约算法在并行计算中应用广泛,目前有很多归约算法应用于不同的情形。这些归约算法各不相同,逻辑拓扑是造成区别的关键。为了统一描述归约算法,揭示它们的共性,给出了一个逻辑拓扑的定义及其性质。在此基础上,给出了归约算法的统一描述,以利于对归约算法的理解,从而设计适应不同应用和环境的归约算法。该描述也可视为可集成不同语义的归约算法框架,从而有助于设计具有新语义的归约算法。本质上,该统一描述是一个归约算法形式定义,有助于验证归约算法的正确性。Reduction algorithms are used widely in parallel computing. There are many reduction algorithms applied to different situations. These reduction algorithms are different from each other. Logical topology is the key cause to make the differences. In order to unify the description of reduction algorithms,and uncover their common feature, a definition of logical topology and its properties were presented in this paper. Based on it, a unified description for reduction algo- rithms was proposed. The description contributes to understand reduction algorithms and thus to design efficient reduc- tion algorithms for different computational applications and environments. It can also be regarded as a reduction algo- rithmic framework for integrating different semantics and thus maybe guide to design new reduction algorithms with the semantics. Essentially,the unified description is a definition of reduction algorithms formally, and so it helps to verify correctness of reduction algorithms.

关 键 词：归约算法 逻辑拓扑 算法描述 并行计算 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]