2714	 Merging with Parallel Processors	 Consider two linearly ordered sets A B A m B n m n and p p m parallel processors working synchronously. The paper presents an algorithm for merging A and B with the p parallel processors which requires at most log m m p m p log n m steps. If n B m B an integer the algorithm requires at most log m m p B steps. In the case where m and n are of the same order of magnitude i.e. n km with k being a constant the algorithm requires log m m p k steps. These performances compare very favorably with the previous best parallel merging algorithm Batcher s algorithm which requires n p m n p log m steps in the general case and km p k m p log m in the special case where n km. parallel processing parallel merging parallel binary insertion
