[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

Deterministic parallel list ranking

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

In this paper we describe a simple parallel algorithm for list ranking. The algorithm is deterministic and runs inO(logn) time on an EREW PRAM withn/logn processors. The algorithm matches the performance of the Cole-Vishkin [CV3] algorithm but is simple and has reasonable constant factors.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. Cole and U. Vishkin. Deterministic coin tossing with applications to optimal parallel list ranking.Information and Computation,70:32–53, 1986.

    MATH  MathSciNet  Google Scholar 

  2. R. Cole and U. Vishkin. The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time.Algorithmica,3:329–346, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  3. R. Cole and U. Vishkin. Approximate parallel scheduling, part I: The basic technique with applications to optimal parallel list ranking on logarithmic time.SIAM Journal on Computing,17:128–142, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  4. R. Cole and U. Vishkin. Faster optimal parallel prefix sums and list ranking.Information and Computation,81:334–352, 1989.

    Article  MATH  MathSciNet  Google Scholar 

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

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

  7. Y. Han. Designing Fast and Efficient Parallel Algorithms. Ph.D. thesis, Duke University, 1987.

  8. S. R. Kosaraju and A. L. Delcher. Optimal parallel evaluation of tree-structured computations by raking. InAegean Workshop on Computing, pages 101–110, 1988.

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

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

  11. S. Rajasekaran and J. Reif. Optimal and sublogarithmic time randomized parallel sorting algorithms.SIAM Journal on Computing,18:594–607, 1989.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

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

  15. J. C. Wyllie. The Complexity of Parallel Computation. Ph.D. thesis, Department of Computer Science, Cornell University, 1979.

Download references

Author information

Authors and Affiliations

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

    Richard J. Anderson

  2. Department of Computer Science, University of Southern California, 90089, Los Angeles, CA, 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

Additional information

Communicated by F. Thomson Leighton.

R. J. Anderson was supported by an NSF Presidential Young Investigator award and G. L. Miller was supported by NSF Grant DCR-85114961.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Anderson, R.J., Miller, G.L. Deterministic parallel list ranking. Algorithmica 6, 859–868 (1991). https://doi.org/10.1007/BF01759076

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation