Skip to main content
Springer Nature Link
Log in

Deterministic parallel list ranking

  • Parallel Tree Contraction
  • Conference paper
  • First Online:
VLSI Algorithms and Architectures (AWOC 1988)

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

Included in the following conference series:

Abstract

In this paper we describe a simple parallel algorithm for list ranking. The algorithm is deterministic and runs in O(log n) time on EREW P-RAM with n/log n processor. The algorithm matches the performance of the Cole-Vishkin [CV86a] algorithm but is simple and has reasonable constant factors.

Supported by an NSF Presidential Young Investigator Award.

Supported by NSF Grant DCR-8514961

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. R. Cole and U. Vishkin. Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms. In Proceedings of the 18th ACM Symposium on Theory of Computation, pages 206–219, 1985.

    Google Scholar 

  2. R. Cole and U. Vishkin. Approximate scheduling, exact scheduling, and applications to parallel algorithms. In 27th Symposium on Foundations of Computer Science, pages 478–491, 1986. Part I to appear in SIAM Journal of Computing.

    Google Scholar 

  3. R. Cole and U. Vishkin. Faster Optimal Parallel Prefix Sums and List Ranking. Technical Report 56/86, Tel Aviv University, December 1986.

    Google Scholar 

  4. H. Gazit, G. L. Miller, and S. H. Teng. Optimal tree contraction in the EREW model. 1986. Extended abstract.

    Google Scholar 

  5. A. V. Goldberg, S. A. Plotkin, and G. E. Shannon. Parallel symmetry-breaking in sparse graphs. In Proceedings of the 19th ACM Symposium on Theory of Computation, pages 315–324, 1987.

    Google Scholar 

  6. Y. Han. Designing Fast and Efficient Parallel Algorithms. PhD thesis, Duke University, 1987.

    Google Scholar 

  7. C. Kruskal, L. Rudolf, and M. Snir. The power of parallel prefix computation. In International Conference on Parallel Processing, pages 180–185, 1985.

    Google Scholar 

  8. B. D. Lubachevsky and A. G. Greenberg. Simple, efficient asynchronous parallel prefix algorithms. In International Conference on Parallel Processing, pages 66–69, 1987.

    Google Scholar 

  9. G. L. Miller and J. H. Reif. Parallel tree contraction and its applications. In 26th Symposium on Foundations of Computer Science, pages 478–489, 1985.

    Google Scholar 

  10. J. H. Reif. An optimal parallel algorithm for integer sorting. In 26th Symposium on Foundations of Computer Science, pages 496–503, 1985.

    Google Scholar 

  11. R. E. Tarjan and U. Vishkin. An efficient parallel biconnectivity algorithm. SIAM Journal on Computing, 14(4):862–874, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  12. U. Vishkin. Randomized speed-ups in parallel computation. In Proceedings of the 16th ACM Symposium on Theory of Computation, pages 230–239 1984.

    Google Scholar 

  13. R. A. Wagner and Y. Han. Parallel algorithms for bucket sorting and the data dependent prefix problem. In International Conference on Paralle Processing, pages 924–930, 1986.

    Google Scholar 

  14. J. C. Wyllie. The Complexity of Parallel Computation. PhD thesis, De partment of Computer Science, Cornell University, 1979.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, FR-35, University of Washington, 98195, Seattle, Washington, USA

    Richard J. Anderson

  2. Department of Computer Science, University of Southern California, 90089, Los Angeles, California, USA

    Gary L. Miller

Authors
  1. Richard J. Anderson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gary L. Miller
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

John H. Reif

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Anderson, R.J., Miller, G.L. (1988). Deterministic parallel list ranking. In: Reif, J.H. (eds) VLSI Algorithms and Architectures. AWOC 1988. Lecture Notes in Computer Science, vol 319. Springer, New York, NY. https://doi.org/10.1007/BFb0040376

Download citation

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

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-96818-6

  • Online ISBN: 978-0-387-34770-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics