Skip to main content
SpringerLink
Log in

Parallel complexity of heaps and min-max heaps

  • Conference paper
  • First Online:
LATIN '92 (LATIN 1992)

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

Included in the following conference series:

Abstract

We study parallel solutions to the problem of implementing priority queues and priority deques. It is known that data structures for the implementation (e.g., the heap, the minmax heap, and the deap) can be constructed in linear sequential time. In this paper, we design optimal Ω((log log n)2) time parallel algorithms with n/(log logn)2 processors for the constructions on the parallel comparison tree model. For building heaps in parallel, our algorithm improves the previous best result of Ω(log n) time with n/log n processors. For building min-max heaps and deaps, our algorithms are the first attempt to design parallel algorithms for constructing the data structures of the priority deque that are cost optimal.

This article was processed using the LATEX macro package with LMAMULT style

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. V. Aho, J. E. Hopocroft, and J. D. Ullman: The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 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 (1989), 125–133.

    Google Scholar 

  3. S. G. Akl: The Design and Analysis of Parallel Algorithms. Prentice-Hall International, Inc., 1989.

    Google Scholar 

  4. Y. Azar and N. Pippengar: Parallel selection. Discrete Applied Mathematics 27 (1990), 49–58.

    Google Scholar 

  5. M. D. Atkinson, J.-R. Sack, N. Santoro, and Th. Strothotte: Min-max heaps and generalized priority queues. Communications of the ACM 29 (1986), 996–1000.

    Google Scholar 

  6. B. Bollobás and I. Simon: Repeated random insertion into a priority queue. Journal of Algorithms 6 (1985), 466–477.

    Google Scholar 

  7. S. Carlsson: A new priority queue for parallel environments. Technical Report LU-CSTR:89-44. Department of Computer Science, Lund University, 1989.

    Google Scholar 

  8. S. Carlsson: Average-case results on heapsort. BIT 27 (1987), 2–17.

    Google Scholar 

  9. S. Carlsson: The deap — A double-ended heap to implement double-ended priority queues. Information Processing Letters 26 (1987), 33–36.

    Google Scholar 

  10. S. Carlsson and J. Chen: The Complexity of Heaps. To appear in: Third Annual ACM-SIAM Symposium on Discrete Algorithms (1992).

    Google Scholar 

  11. S. Carlsson, J. Chen, and Th. Strothotte: A note on the construction of the data structure “Deap”. Information Processing Letters 31 (1989), 315–317.

    Google Scholar 

  12. E. E. Doberkat: An average case analysis of Floyd's algorithm to construct heaps. Information and Control 61 (1984), 114–131.

    Google Scholar 

  13. R. W. Floyd: Algorithm 245 — Treesort 3. Communications of the ACM 7 (1964), p. 701.

    Google Scholar 

  14. G. H. Gonnet and J. I. Munro: Heaps on heaps. SIAM Journal on Computing 15 (1986), 964–971.

    Google Scholar 

  15. A. Hasham and J.-R. Sack: Bounds for min-max heaps. BIT 27 (1987), 315–323.

    Google Scholar 

  16. D. E. Knuth: The Art of Computer Programming. Vol. 3: Sorting and Searching. AddisonWesley, Reading, MA, 1973.

    Google Scholar 

  17. C. J. H. McDiarmid and B. A. Reed: Building heaps fast. Journal of Algorithms 10 (1989), 352–365.

    Google Scholar 

  18. T. Porter and I. Simon: Random insertion into a priority queue structure. IEEE Transactions on Software Engineering SE-1 (1975), 292–298.

    Google Scholar 

  19. N. S. V. Rao and W. Zhang: Building heaps in parallel. Information Processing Letters 37 (1991), 355–358.

    Google Scholar 

  20. R. Reischuk: Probabilistic parallel algorithms for sorting and selection. SIAM Journal on Computing 14 (1983), 396–409.

    Google Scholar 

  21. Y. Shiloach and U. Vishkin: Finding the maximum, merging, and sorting in a parallel computation model. Journal of Algorithms 2 (1981), 88–102.

    Google Scholar 

  22. Th. Strothotte, P. Eriksson, and S. Vallner: A note on constructing min-max heaps. BIT 29 (1989), 251–256.

    Google Scholar 

  23. L. G. Valiant: Parallelism in comparison problems. SIAM Journal on Computing 4 (1975), 348–355.

    Google Scholar 

  24. J. W. J. Williams: Algorithm 232: Heapsort. Communications of the ACM 7 (1964), 347–348.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Division of Computer Science and Engineering, Luleå University of Technology, S-951 87, Luleå, Sweden

    Svante Carlsson

  2. Department of Computer Science, Lund University, Box 118, S-221 00, Lund, Sweden

    Jingsen Chen

Authors
  1. Svante Carlsson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jingsen Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Imre Simon

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Carlsson, S., Chen, J. (1992). Parallel complexity of heaps and min-max heaps. In: Simon, I. (eds) LATIN '92. LATIN 1992. Lecture Notes in Computer Science, vol 583. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023822

Download citation

  • DOI: https://doi.org/10.1007/BFb0023822

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55284-0

  • Online ISBN: 978-3-540-47012-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation