| 划分点定位并行排序算法 |
| |
| 引用本文： | 颜启华,潘久辉.划分点定位并行排序算法[J].计算机研究与发展,2002,39(5):631-637. |
| |
| 作者姓名： | 颜启华 潘久辉 |
| |
| 作者单位： | 华南师范大学计算机科学系,广州,510631 |
| |
| 基金项目： | 广东省自然科学基金资助 ( 990 460 ) |
| |
| 摘 要： | 提出并分析了划分点定位并行排序（parallel sorting by divide-point locating)算法。在算法中，输入数据被平均划分并分配给所有处理机，因此每个处理机具有相同的工作负载。给出了网络分布计算环境下PSDL算法的实验结果，并与PSRS算法进行了对比。理论分析和实验结果表明，PSDL算法是一种高效率、高扩展性的并行排序算法。
|
| 关 键 词： | 并行排序 划分点 划分点定位算法 并行排序算法 计算机 |
THE PARALLEL SORTING BY DIVIDE-POINT LOCATING ALOGRITHM |
| |
| YAN Qi,Hua and PAN Jiu,Hui.THE PARALLEL SORTING BY DIVIDE-POINT LOCATING ALOGRITHM[J].Journal of Computer Research and Development,2002,39(5):631-637. |
| |
| Authors: | YAN Qi Hua and PAN Jiu Hui |
| |
| Abstract: | 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. |
| |
| Keywords: | parallel sorting divide point divide point locating algorithm parallel sorting |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
