To avoid memory access conflict, the algorithms are based on a parallelmergealgorithm.
为了避免存储访问冲突,算法采用了基于并行归并的并行排序方法。
2
Merge-sort is not an inherently parallelalgorithm, 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.