Skip to main content
SpringerLink
Log in
Book cover

Scandinavian Workshop on Algorithm Theory

SWAT 1992: Algorithm Theory — SWAT '92 pp 140–150Cite as

Heap construction in the parallel comparison tree model

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 621))

Abstract

I show how to put n values into heap order in O(log log n) time using n/ log log n processors in the parallel comparison tree model of computation, and in Õ(α(n)) time on n/α(n) processors, in the randomized parallel comparison tree model, where α(n) is an inverse of Ackerman's function. I prove similar bounds for the related problem of putting n values into a min-max heap.

This work supported by NSF grant CCR-8909667.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, New York, 1974.

    Google Scholar 

  2. M. Ajtai, J. Komlós, W. L. Steiger, and E. Szemerédi. Optimal parallel selection has complexity O(log log n). Journal of Computer and System Sciences, 38:125–133, 1989.

    Google Scholar 

  3. M. Atkinson, J. Sack, N. Santoro, and T. Strothotte. Min-max heaps and generalized priority queues. Communications of the ACM, 29(10):996–1000, October 1986.

    Google Scholar 

  4. Y. Azar and N. Pippenger. Parallel selection. Discrete Appl. Math., 27:49–58, 1990.

    Google Scholar 

  5. Omer Berkman and Uzi Vishkin. Recursive *-tree parallel data-structure. In Proc. 30th Ann. IEEE Symp. on Foundations of Computer Science, pages 196–202, October 1989.

    Google Scholar 

  6. Svante Carlsson and Jingsen Zhang. Parallel complexity of heaps and min-max heaps. Technical Report LU-CS-TR:91-77, Department of Computer Science, Lund University, Lund, Sweden, August 1991.

    Google Scholar 

  7. Y. Matias O. Berkman and U. Vishkin, July 1991. Unpublished manuscript.

    Google Scholar 

  8. N. S. V. Rao and W. Zhang. Building heaps in parallel. Info. Proc. Lett., 37:355–358, 1991.

    Google Scholar 

  9. Rüdiger Reischuk. Probabilistic parallel algorithms for sorting and selection. SIAM J. On Computing, 14(2):396–409, May 1985.

    Google Scholar 

  10. Leslie G. Valiant. Parallelism in comparison problems. SIAM J. On Computing, 4(3):348–355, September 1975.

    Google Scholar 

  11. Uzi Vishkin. Structural parallel algorithmics. In ICALP 91, pages 363–380, July 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Rochester, 14627, Rochester, NY

    Paul F. Dietz

Authors
  1. Paul F. Dietz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Otto Nurmi Esko Ukkonen

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dietz, P.F. (1992). Heap construction in the parallel comparison tree model. In: Nurmi, O., Ukkonen, E. (eds) Algorithm Theory — SWAT '92. SWAT 1992. Lecture Notes in Computer Science, vol 621. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55706-7_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-55706-7_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55706-7

  • Online ISBN: 978-3-540-47275-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation