划分点定位并行排序算法  

THE PARALLEL SORTING BY DIVIDE-POINT LOCATING ALOGRITHM

作　　者：颜启华[1] 潘久辉[1] 

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

出　　处：《计算机研究与发展》2002年第5期631-637,共7页Journal of Computer Research and Development

基　　金：广东省自然科学基金资助 ( 990 460 )

摘　　要：提出并分析了划分点定位并行排序 ( parallel sorting by divide- point locating)算法 .在算法中 ,输入数据被平均划分并分配给所有处理机 ,因而每个处理机具有相同的工作负载 .给出了网络分布计算环境下 PSDL算法的实验结果 ,并与 PSRS算法进行了对比 .理论分析和实验结果表明 ,PSDL算法是一种高效率。The parallel sorting by divide point locating (PSDL) algorithm is proposed and analyzed in this paper. In the algorithm, input data are averagely partitioned and distributed to all processors, so each processor has the same workload. The experimental results of the PSDL algorithm under network distributed computing environment are given and compared with that of the PSRS algorithm. According to the theoretical analysis and experimental results, the PSDL algorithm is an efficient and scalable algorithm of parallel sorting.

关 键 词：并行排序 划分点 划分点定位算法 并行排序算法 计算机 

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