出版社：Electronics and Telecommunications Research Institute
摘要：Given two sorted lists A=(a0, a1, ,a -1}) and B=(b0, b1, , bm-1), we are to merge these two lists into a sorted list C=(c0,c1, , cn-1), where n= +m. Since this is a fundamental problem useful to solve many problems such as sorting and graph problems, there have been many efficient parallel algorithms for this problem. But these algorithms cannot be performed efficiently in the postal model since the communication latency , which is of prime importance in this model, is not needed to be considered for those algorithms. Hence, in this paper we propose an efficient merge algorithm in this model that runs in time by using a new property of the bitonic sequence which is crucial to our algorithm. We also show that our algorithm is near-optimal by proving that the lower bound of this problem in the postal model is , where .
