Abstract
Comparator networks for constructing binary heaps of size n are presented which have size O(n log log n) and depth O(log n). A lower bound of n log log n — O(n) for the size of any heap construction network is also proven, implying that the networks presented are within a constant factor of optimal. We give a tight relation between the leading constants in the size of selection networks and in the size of heap construction networks.
This research was done while the first author was visiting the Istituto di Elaborazione della Informazione, CNR, Pisa.
Supported by the Carlsberg foundation (Grant No. 96-0302/20). Partially supported by the ESPRIT Long Term Research Program of the EU under contract No. 20244 (ALCOM-IT).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Miklós Ajtai, János Komlós, and Endre Szemerédi. Sorting in c log n parallel steps. Combinatorica, 3:1–19, 1983.
Vladimir Evgen'evich Alekseev. Sorting algorithms with minimum memory. Kibernetika, 5(5):99–103, 1969.
Samuel W. Bent and John W. John. Finding the median requires 2n comparisons. In Proc. 17th Ann. ACM Symp. on Theory of Computing (STOC), pages 213–216, 1985.
Manuel Blum, Robert W. Floyd, Vaughan Pratt, Ronald L. Rivest, and Robert Endre Tarjan. Time bounds for selection. Journal of Computer and System Sciences, 7:448–461, 1973.
Paul F. Dietz. Heap construction in the parallel comparison tree model. In Proc. 3rd Scandinavian Workshop on Algorithm Theory (SWAT), volume 621 of Lecture Notes in Computer Science, pages 140–150. Springer Verlag, Berlin, 1992.
Paul F. Dietz and Rajeev Raman. Very fast optimal parallel algorithms for heap construction. In Proc. 6th Symposium on Parallel and Distributed Processing, pages 514–521, 1994.
Dorit Dor and Uri Zwick. Selecting the median. In Proc. 6th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 28–37, 1995.
Dorit Dor and Uri Zwick. Finding the alpha n-th largest element. Combinatorial, 16:41–58, 1996.
Dorit Dor and Uri Zwick. Median selection requires (2 + ε)n comparisons. In Proc. 37th Ann. Symp. on Foundations of Computer Science (FOCS), pages 125–134, 1996.
Robert W. Floyd. Algorithm 245: Treesort3. Communications of the ACM, 7(12):701, 1964.
Shuji Jimbo and Akira Maruoka. A method of constructing selection networks with O(log n) depth. SIAM Journal of Computing, 25(4):709–739, 1996.
Donald E. Knuth. The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley, Reading, MA, 1973.
Peter Bro Miltersen, Mike Paterson, and Jun Tarui. The asymptotic complexity of merging networks. Journal of the ACM, 43(1):147–165, 1996.
Stephan Olariu and Zhaofang Wen. Optimal parallel initialization algorithms for a class of priority queues. IEEE Transactions on Parallel and Distributed Systems, 2:423–429, 1991.
Nicholas Pippenger. Selection networks. SIAM Journal of Computing, 20(5):878–887, 1991.
Arnold Schönhage, Michael S. Paterson, and Nicholas Pippenger. Finding the median. Journal of Computer and System Sciences, 13:184–199, 1976.
John William Joseph Williams. Algorithm 232: Heapsort. Communications of the ACM, 7(6):347–348, 1964.
Andrew C. Yao and Frances F. Yao. Lower bounds on merging networks. Journal of the ACM, 23:566–571, 1976.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brodal, G.S., Pinotti, M.C. (1998). Comparator networks for binary heap construction. In: Arnborg, S., Ivansson, L. (eds) Algorithm Theory — SWAT'98. SWAT 1998. Lecture Notes in Computer Science, vol 1432. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054364
Download citation
DOI: https://doi.org/10.1007/BFb0054364
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64682-2
Online ISBN: 978-3-540-69106-8
eBook Packages: Springer Book Archive