| 线性递归并行排序算法 |
| |
| 引用本文： | 蒙祖强 郑金华. 线性递归并行排序算法[J]. 湘潭大学自然科学学报, 1999, 21(1): 52-54 |
| |
| 作者姓名： | 蒙祖强 郑金华 |
| |
| 作者单位： | 湘潭大学计算机科学系 |
| |
| 摘 要： | 应用左递归二叉树构造一个新的并行排序算法，对ｐ个有序块进行排序．从而，将ｎ元素的分类问题转化为对ｐ个有序块的并行排序问题．算法在最坏情况下并行步为Ｏ（（ｎ／ｐ）ｌｏｇｎ／ｐ），是目前比较好的排序算法．
|
| 关 键 词： | 并行排序；有序块；并行合并策略；线性递归 |
| 修稿时间： | :1998-10-1 |
LINEAR RECURRENCE AND PARALLEL SORTING ALGORITHM |
| |
| Meng Zuqiang Zhen Jinhua. LINEAR RECURRENCE AND PARALLEL SORTING ALGORITHM[J]. Natural Science Journal of Xiangtan University, 1999, 21(1): 52-54 |
| |
| Authors: | Meng Zuqiang Zhen Jinhua |
| |
| Abstract: | In this paper,the application of left recursive binary tree to the design of a new parallel sorting algorithm which is used to sort p sorted blocks is described And the a method of sorting parallel blocks instead of sorting n elements is given.this algorithm's time complexity is O((n/p) log n/p )for the worst case.this is a good one of the currently popular parallel sorting algorithms. |
| |
| Keywords: | parallel sorting sorted blocks parallel combining linear recurrence |
| 本文献已被 CNKI 维普 等数据库收录！ |
