并行排序算法是计算机并行计算能力大大发展之后,为了提高排序效率而提出的算法。
...的PDQ技术主要包括一下并行操作: 1)并行扫描(Parallel scans) 2)并行连接(Parallel joins) 3)并行排序(Parallel sorts) 4)并行组
基于58个网页-相关网页
In this paper, a new parallel sorting algorithm is proposed. Its efficiency is O(1), and it works in much fewer steps.
本文提出一种新的并行排序算法,其效率为O(1),而并行步数少于[1]和[2]的算法的并行步数。
参考来源 - 并行归并排序算法 in C·2,447,543篇论文数据,部分数据来源于NoteExpress
为了避免存储访问冲突,算法采用了基于并行归并的并行排序方法。
To avoid memory access conflict, the algorithms are based on a parallel merge algorithm.
这使用了二分法思想,利用双调序列,构造出了一种并行的排序算法:双调排序网络。
It constructs a kind of pallel sorting algorithm bitonic sorting net, taking advantage of dichotomy ideas and bitonic serial.
定义一个严格的序列,比如在瀑布模型中,与在并行工作中定义一个半排序的迭代序列是基本相同的。
Defining a strict sequence, as in a waterfall model, is just as much a process as defining a semi-ordered sequence of iterations in parallel work.
应用推荐