划分点定位并行并操作算法  

Parallel UNION by divide-point locating algorithm

作　　者：颜启华[1] 

机构地区：[1]华南师范大学计算机学院,广东广州510631

出　　处：《计算机工程与设计》2008年第10期2570-2572,共3页Computer Engineering and Design

摘　　要：提出了一种新的并行并操作算法PUDL,充分利用DL子算法能精确定位多个划分点的特性,使得划分后各个处理机要处理的子关系大小相等。因而算法具有较高的负载平衡性、可扩展性。最后给出了基于PC集群的实验结果,并把该结果与UNION-S、UNION-NS算法作了比较。A new parallel union algorithm is proposed. Taking advantage of sub algorithm DL that can locate multiple divide point accurately, sub relation on each processor has equal size, The algorithm brings balanced workload and reach high efficiency and scalability. In the end the result based on PC cluster are provided and compared with those of UNION-S and UNION-NS algorithm.

关 键 词：并行并操作 划分点 DL算法 PUDL算法 UNION-S算法 UNION-NS算法 

分 类 号：TP311.133[自动化与计算机技术—计算机软件与理论]