Merging heaps in parallel

Recently, Sack and Strothotte [8] proposed an efficient algorithm to merge two heaps. We propose to show that the algorithm in Sack and Strothotte [8] can be easily parallelized. More specifically, with heaps H and H′ with n and k elements, respectively, as input, our algorithm constructs a new heap containing all the keys in H and H′ combined in O(log n) time using at most min {[log n] − [log k], [log k]} + 1 processors in the EREW-PRAM model.