The Journal of the Acoustical Society of Korea (한국음향학회지)
- Volume 12 Issue 2
- /
- Pages.5-13
- /
- 1993
- /
- 1225-4428(pISSN)
- /
- 2287-3775(eISSN)
On the parallel merging algorithm
Heap 병합 병렬 알고리즘
Abstract
The purpose of this paper is to suggest and analyze the parallel algorithm for merging two heaps, on SIMD-SM-R parallel computer. In order to create the parallel algorithm for merging two heaps, we have classified two subproblems. For the first method, to select node p as a LEVEL-FIND function, Wyllie(19) suggests the method with time complexity O(log n) while this thesis has O(log(n/k)). For the second method, to merge two subheap, our algorithm has O(log(n/k)*log(n)) using max(2**(i-1), 「(m+1)/4」)'s processors while Dekel and Sahni(4)'s method and Hong's method(18) have O(log m). Also our parallel algorithm's EPU is close to 1 and so has an optimal speed-up ratio.
Keywords