Emad Omara's parallel merge sort algorithm assumes that you will have full access to the machine's CPUs for the duration of the sorting operation.
EmadOmara的并行合并排序算法假设了在排序操作的过程中(操作者)对计算机的所有CPU具有完全的访问权限。
Merge-sort is not an inherently parallel algorithm, as it can be done sequentially, and is popular when the data set is too large to fit in memory and must be sorted in pieces.
合并排序本身并非并行算法，因为它可以顺序执行。当数据集太大，内存无法容纳，必须分片保存的时候，经常使用合并排序。
PTSA provides many possible choices for all sub-projects in a project which will be arranged in serial or parallel way, so PTSA improves the applied value of Topological Sort Algorithm.
PTSA算法为工程中各子工程的串行或并行安排提供了确定的选择，提升了拓扑排序算法的实用价值。
The article, based on asynchronous parallel quick sort algorithm, analyzes the sorting process, gives the multi-thread implment, points out the executing feature.
分析快速排序异步并行算法的排序过程，给出快速排序异步并行算法的多线程实现方式，指出算法多线程实现的特性。
Instead of parallel bucket sort recommended by some authors, a scheme using parallel regular sampling sort algorithm to construct the finest level data of the distributed tree is presented.
研究了最细层数据的建立方法，提出采用并行正则采样排序算法来代替众多文献所推荐的并行桶排序算法，以此来建立分布树的最细层数据。
This paper explains and analyzes odd-even exchange sort, it also provides a parallel algorithm by language C, and finds an efficient sorting method for parallel-processing system.
介绍了奇偶交换排序，给出了用C语言实现奇偶交换排序的并行算法，从而找到了一种基于并行处理系统的有效排序方法。
This paper explains and analyzes odd-even exchange sort, it also provides a parallel algorithm by language C, and finds an efficient sorting method for parallel-processing system.
介绍了奇偶交换排序，给出了用C语言实现奇偶交换排序的并行算法，从而找到了一种基于并行处理系统的有效排序方法。
应用推荐