LOGARITHMIC TIME SORT FOR LINEAR SIZE NETWORKS.

被引:0
|
作者
Reif, John H. [1 ]
Valiant, Leslie G. [1 ]
机构
[1] Harvard Univ, Cambridge, MA, USA, Harvard Univ, Cambridge, MA, USA
来源
| 1600年 / 34期
关键词
COMPUTER PROGRAMMING - Algorithms;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A randomized parallel algorithm that sorts on an N node network with constant valence in O(log N) time is given. More particularly, the algorithm sorts N items on an N-node cube-connected cycles graph, and, for some constant k, for all large enough alpha , it terminates with k alpha log N time with probability at least 1 minus N** minus ** alpha .
引用
收藏
相关论文
共 50 条