Abstract
We examine the average running times of Batcher's bitonic merge and Batcher's odd-even merge when they are used as parallel merging algorithms. It has been shown previously that the running time of odd-even merge can be upper bounded by a function of the maximal rank difference for elements in the two input sequences. Here we give an almost matching lower bound for odd-even merge as well as a similar upper bound for (a special version of) bitonic merge. From this follows that the average running time of odd-even merge (bitonic merge) is Θ((n/p)(1+log(1+p 2/n))) (O((n/p)(1+log(1+p 2/n))), resp.) where n is the size of the input and p is the number of processors. Using these results we then show that the average running times of odd-even merge sort and bitonic merge sort are O((n/p) (log n + (log(1 +p2/n))2)), that is, the two algorithms are optimal on the average if \(n \geqslant p^2 /2^{\sqrt {\log p} }\).
Preview
Unable to display preview. Download preview PDF.
References
K. E. Batcher. Sorting networks and their applications.Proceedings of AFIPS Spring Joint Computer Conference, pages 307–314, 1968.
G. Bilardi. Merging and sorting networks with the topology of the omega network. IEEE trans. on comp., C-38, 10:1396–1403, 1989.
K. Brockmann and R. Wanka. Efficient oblivious parallel sorting on the MasPar MP-1. In Proc. 30th Hawaii International Conference on System Sciences (HICSS). IEEE, 1997.
M. Dowd, Y. Perl, L. Rudolph, and M. Saks. The periodic balanced sorting network. Journal of the ACM, 36(4):738–757, 1989.
W. Feller. An Introduction to Probability Theory and Its Applications I. John Wiley, New York, second edition, 1950.
D. E. Knuth. Sorting and Searching, volume 3 of The Art of Computer Programming. Addison-Wesley, Reading, MA, USA, 1973.
C. Rüb. On batcher's merge sorts as parallel sorting algorithms. Technical Report MPI-I-97-1-012, Max-Planck-Institut für Informatik, 1997.
C. Rüb. On the average running time of odd-even merge sort. Journal of Algorithms, 22(2):329–346, 1997.
A. Wachsmann and R. Wanka. Sorting on a massively parallel system using a library of basic primitives: Modeling and experimental results. In European Conference in Parallel Processing (EURO-PAR), 1997.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag
About this paper
Cite this paper
Rüb, C. (1998). On Batcher's merge sorts as parallel sorting algorithms. In: Morvan, M., Meinel, C., Krob, D. (eds) STACS 98. STACS 1998. Lecture Notes in Computer Science, vol 1373. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028577
Download citation
DOI: https://doi.org/10.1007/BFb0028577
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64230-5
Online ISBN: 978-3-540-69705-3
eBook Packages: Springer Book Archive