简化、稳定的并行合并
Simplified, stable parallel merging
摘要：
本文提出了一个观察，大大简化了以前的并行，双向合并算法的基础上二分搜索和顺序合并并行。首先，它表明，在以前的算法中发现的区别元素的额外的合并步骤是不必要的，从而简化了实现和减少常数因子。第二，通过固定对二分查找的要求，合并算法变得稳定，只要顺序合并子例程是稳定的。稳定的并行归并算法可以很容易地用来实现稳定的并行归并排序。对于具有$n$和$m$元素$m\leq n$的有序序列，简化合并算法在使用$p$处理元素的$O(n/p+\log n)$操作中运行。它可以在EREW PRAM上实现，但由于它只需要一个同步步骤，因此它也可以在其他并行共享内存计算机上实现。
英文摘要：
This note makes an observation that significantly simplifies a number of previous parallel, two-way merge algorithms based on binary search and sequential merge in parallel. First, it is shown that the additional merge step of distinguished elements as found in previous algorithms is not necessary, thus simplifying the implementation and reducing constant factors. Second, by fixating the requirements to the binary search, the merge algorithm becomes stable, provided that the sequential merge subroutine is stable. The stable, parallel merge algorithm can easily be used to implement a stable, parallel merge sort. For ordered sequences with $n$ and $m$ elements, $m\leq n$, the simplified merge algorithm runs in $O(n/p+\log n)$ operations using $p$ processing elements. It can be implemented on an EREW PRAM, but since it requires only a single synchronization step, it is also a candidate for implementation on other parallel, shared-memory computers.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
