Skip to main content
SpringerLink
Log in

O(log*n) algorithms on a Sum-CRCW PRAM

  • Published:
Computing Aims and scope Submit manuscript

Abstract

We present work- and cost-optimal O(log*n) algorithms for prefix sums and linear integer sorting on a Sum-CRCW PRAM.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Akl, S. G.: Parallel computation: Models and methods. Prentice-Hall 1997.

  • S. G. Akl L. Chen (1999) ArticleTitleOn the power of some PRAM models Parallel Algorith. Appl. 13 307–319 Occurrence Handle0928.68131 Occurrence Handle1687404

    MATH  MathSciNet  Google Scholar 

  • R. Cole U. Vishkin (1989) ArticleTitleFaster optimal parallel prefix sums and list ranking Inf. Control 81 334–352 Occurrence Handle0684.68048 Occurrence Handle1000070

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Yale University, P. O. Box 208285, New Haven, CT, 06520-8285, USA

    S. C. Eisenstat

Authors
  1. S. C. Eisenstat
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. C. Eisenstat.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Eisenstat, S.C. O(log*n) algorithms on a Sum-CRCW PRAM. Computing 79, 93–97 (2007). https://doi.org/10.1007/s00607-006-0214-y

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00607-006-0214-y

AMS Subject Classifications

Keywords

Search

Navigation