A fast parallel merging algorithm for 2–3 trees
A parallel algorithm is presented which merges two sorted lists represented as 2–3 trees of length m and n (m≦ n), respectively, with at most 2m processors within O(log n) time. The consideration for the time complexity includes comparisons, allocation of processors, and construction of an output 2–3 tree. The algorithm is performed without read conflicts.
Unable to display preview. Download preview PDF.
- 1.AHO, A.V., HOPCROFT, J.E., and ULLMAN, J.D. The Design and Analysis of Computer Algorithms. Addison-Wesley, (1974).Google Scholar
- 3.DEKEL, D. and SAHNI, S. Binary Trees and Parallel Scheduling Algorithms. CONPAR 81, Lecture Notes on Computer Science Springer-Verlag, Vol. 111, pp. 480–492.Google Scholar
- 4.GAVRIL, F. Merging with Parallel Processors. CACM, Vol. 18, No. 10(1975), pp. 588–591.Google Scholar
- 5.HIRSCHBERG, D. S. Fast Parallel Sorting Algorithms. CACM, Vol. 21, No. 8(1978), pp. 657–661Google Scholar
- 7.PREPARATA, F. P. New Parallel Sorting Schemes. IEEE Trans. on Computers, C-27 No. 7(1978) pp. 669–673.Google Scholar
- 8.SHIBAYAMA, E. A Fast Parallel Merging Algorithm for 2–3 trees. Master Thesis, Research Institute for Mathematical Sciences, Kyoto Univ(1983).Google Scholar
- 9.SHILOACH, Y. and VISHIKIN, U. Finding the Maximum, Merging, and Sorting in a Parallel Computation Model. Journal of Algorithms, Vol. 1, No. 2(1981), pp. 81–102.Google Scholar