Skip to main content
SpringerLink
Log in

On the power of nonconservative PRAM

  • Contributed Papers
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1996 (MFCS 1996)

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

  • 161 Accesses

Abstract

An alternative simple method of exploiting word parallelism in a nonconservative RAM and PRAM model is considered. In effect, improved bounds for parallel integer sorting in the nonconservative and conservative EREW PRAM models are obtained.

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. Aho, J.E. Hopcroft and J.D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA, 1974.

    Google Scholar 

  2. A. Andersson, T. Hagerup, S. Nilsson and R. Raman. Sorting in Linear Time ? Proc. 27-th Annual ACM Symposium on Theory of Computing, 1995, pp. 427–436.

    Google Scholar 

  3. M. Ajtai, J. Komlos and E. Szemeredi. An O(n log n) sorting network. Proc. 15-th Annual ACM Symposium on Theory of Computing, 1983, pp. 1–9.

    Google Scholar 

  4. S. Albers and T. Hagerup. Improved Parallel Integer Sorting without Concurrent Writing. Proceedings of Symposium on Discrete Algorithms, 1992, pp. 463–472.

    Google Scholar 

  5. R. Cole and U. Vishkin. Approximate Parallel Scheduling. Part 1: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time. SIAM J. Comput. 17(1), 1988, pp. 128–142.

    Article  Google Scholar 

  6. T. Hagerup and H. Shen. Improved nonconservative sequential and parallel integer sorting. Information Processing Letters 36, 1990, pp. 57–63.

    Google Scholar 

  7. J. Hopcroft, W. Paul and L. Valiant. On time versus space and related problems. In Proc. 16-th Annual IEEE Symposium on the Foundations of Computer Science, 1975, pp. 57–64.

    Google Scholar 

  8. R. M. Karp and V. Ramachandran. Parallel algorithms for shared memory machines. In: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. A (Elsevier Science Publishers, 1990), pp. 869–941.

    Google Scholar 

  9. D.G. Kirkpatrick and S. Reisch. Upper bounds for sorting integers on random access machines. Theoretical Computer Science 28, 1984, pp. 263–276.

    Article  Google Scholar 

  10. R. Ostrovsky. Efficient Computation on Oblivious RAMs. In Proc. 22-nd Annual ACM Symposium on Theory of Computing, 1990, pp. 514–523.

    Google Scholar 

  11. W.J. Paul and J. Simon. Decision trees and random access machines. Proc. International Symposium on Logic and Algorithmic, Zürich, 1980, pp. 331–340.

    Google Scholar 

  12. N. Pippenger and M. Fischer. Relations among complexity measures. JACM 26, pp. 361–381.

    Google Scholar 

  13. C. Schnorr. The network complexity and the Turing machine complexity of finite functions. Acta Inform. 7, 1976, pp. 95–107.

    Article  Google Scholar 

  14. A. Schönhage and V. Strassen. Schnelle Multiplikation grosser Zahlen. Computing 7, 1971, pp. 281–322.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Lund University, Box 117, S-221 00, Lund, Sweden

    Anders Dessmark & Andrzej Lingas

Authors
  1. Anders Dessmark
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrzej Lingas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wojciech Penczek Andrzej Szałas

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dessmark, A., Lingas, A. (1996). On the power of nonconservative PRAM. In: Penczek, W., Szałas, A. (eds) Mathematical Foundations of Computer Science 1996. MFCS 1996. Lecture Notes in Computer Science, vol 1113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61550-4_157

Download citation

  • DOI: https://doi.org/10.1007/3-540-61550-4_157

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation