摘要
应用左递归二叉树构造一个新的并行排序算法，对ｐ个有序块进行排序．从而，将ｎ元素的分类问题转化为对ｐ个有序块的并行排序问题．算法在最坏情况下并行步为Ｏ（（ｎ／ｐ）ｌｏｇｎ／ｐ），是目前比较好的排序算法．
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.
出处
《湘潭大学自然科学学报》
CAS
CSCD
1999年第1期52-54,共3页
Natural Science Journal of Xiangtan University
基金
国家自然科学基金
关键词
并行排序
并行合并策略
线性递归
排序
算法
parallel sorting,sorted blocks,parallel combining,linear recurrence
