基于平衡划分的并行集合交算法  

Parallel set-intersection algorithm based on balanced partition

作　　者：颜启华[1] 

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

出　　处：《计算机工程与设计》2007年第12期2782-2784,共3页Computer Engineering and Design

摘　　要：对集合交运算,基于划分点定位算法提出并分析了一种新的并行算法INTERSECT-DL。在INTERSECT-DL算法中,数据被平衡地划分,分配给所有处理机,所以各处理机的工作负载相同。给出了在网络并行计算环境下的实验结果,并与INTERSECT-SI、NTERSECT-NS算法进行了对比。理论分析和实验的结果都表明INTERSECT-DL算法具有很高的并行效率和扩展性。For set-intersection operation, a new parallel algorithm based on divide-point locating algorithm, INTERSECT-DLalgorithm, is proposed and analyzed. This Algorithm partitions data averagely and distributes them to all processors, so each processor has the same workload. The experimental results of this algorithm under network parallel computing environment are given and compared with those of INTERSECT-S and INTERSECT-NS algorithm. According to theoretical analysis and experimental results, the INTERSECT-DL algorithm has high efficiency and scalability.

关 键 词：集合交 划分点 划分点定位算法 INTERSECT-DL算法 INTERSECT-S算法 INTERSECT-NS算法 

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