Skip to main content
SpringerLink
Log in

Efficient parallel computing with memory faults

  • Technical Contributions
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1997)

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

Included in the following conference series:

Abstract

In this paper we show two results on PRAM with constant fraction of memory faults. First we show how to preprocess (i.e. connect a constant fraction of processors into a binary tree) a faulty EREW PRAM with n/log n processors and O(n) memory cells in O(log n) time. The preprocessing is a basic step of simulations from [7, 9, 17]. Our algorithm, together with the results from [17], gives a first fully work-optimal randomized simulations of EREW on EREW with faults with logarithmic overhead. In the second part of this paper, we consider the CRCW PRAM with memory faults. We show that (after O(log* n)-time preprocessing) any algorithm for O(n)-processor PRAM can be simulated with optimal work in O(log* n) time on CRCW with memory faults. The simulation improves the result of [7]. All simulations assume static faults, i.e. that the errors are determined before the computation starts and that no new errors occur during the computation.

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. N. Alon, and F.R.K. Chung, Explicit construction of linear sized tolerant networks, Discrete Mathematics (1988), vol. 72, pp. 15–19.

    Article  Google Scholar 

  2. Y. Afek, D.S. Greenberg, M. Merrit, and G.Taubenfeld, Computing with Faulty Shared Memory, in Proceedings 11th Ann. Symposium on Principles of Distributed Computing (1992), pp. 47–58.

    Google Scholar 

  3. H. Bast, T. Hagerup, Fast and reliable parallel hashing, in Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures (1991), pp. 50–61.

    Google Scholar 

  4. J.F. Buss, P.C. Kanellakis, P.L. Ragde, A.A. Shvartsman, Parallel algorithms with processor failures and delays. Journal of Algorithms 20 (1996), no. 1, p. 45–86.

    Article  Google Scholar 

  5. P. Berenbrink, F. Meyer auf der Heide, V. Stemann, Fault-Tolerant Shared Memory Simulations, in Proceedings of 13th Annual Symposium on Theoretical Aspects of Computer Science (1996), Springer LNCS 104, pp 181–192.

    Google Scholar 

  6. O. Berkman and U. Vishkin, Recursive star-tree parallel data structure, SIAM J. Comput. 22 (1993), 221–242.

    Article  Google Scholar 

  7. B.S. Chlebus, A. Gambin, and P. Indyk, PRAM computations resilient to memory faults, in Proceedings of the 2nd Annual European Symposium on Algorithms, ed. J. van Leeuwen, Utrecht, The Netherlands (1994), Springer LNCS 855, pp. 401–412.

    Google Scholar 

  8. B.S. Chlebus, A. Gambin, and P. Indyk, Shared-Memory Simulations on a Faulty DMM, in Proceedings of the 23rd International Colloquium on Automata, Languages and Programming (1996).

    Google Scholar 

  9. B.S. Chlebus, L. Gąsieniec, and A. Pelc, Fast Deterministic Simulation of Computations on Faulty Parallel Machines, in Proceedings of the 3rd Annual European Symposium on Algorithms, ed. J. van Leeuwen, Corfu, Greece (1995), Springer LNCS 979, pp. 89–101.

    Google Scholar 

  10. K. Diks, Personal Communication.

    Google Scholar 

  11. K. Diks and A. Pelc, Reliable computations on faulty EREW PRAM, Theoretical Computer Science, to appear.

    Google Scholar 

  12. W. Feller, An Introduction to Probability Theory and Its Applications, Wiley, New York (1950).

    Google Scholar 

  13. O. Gabber, and Z. Galil, Explicit constructions of linear-sized superconcentrators, J. Comput. System Sci., vol. 22 (1981), pp. 407–420.

    Article  Google Scholar 

  14. A. Gibbons, and W. Rytter, “Efficient Parallel Algorithms”, Cambridge University Press (1988).

    Google Scholar 

  15. T. Hagerup, The Log-star Revolution, Proc. 9th Annual Symposium on Theoretical Aspects of Computer Science (1992), Springer LNCS, Vol. 577, pp. 259–278.

    Google Scholar 

  16. T. Hagerup, and Ch. Rüb, A Guided Tour of Chernoff Bounds, Inf. Proc. Letters 33 (1989/90), pp. 305–308.

    Article  Google Scholar 

  17. P. Indyk, On Word-Level Parallelism in Fault-Tolerant Computing, in Proceedings of 13th Annual Symposium on Theoretical Aspects of Computer Science (1996), Springer LNCS 1046, pp. 193–204.

    Google Scholar 

  18. J. JáJá, “An Introduction to Parallel Algorithms”, Addison Wesley, Reading, MA (1992).

    Google Scholar 

  19. P.C. Kanellakis, D. Michailidis, Shvartsman, A.A., Controlling memory access concurrency in efficient fault-tolerant parallel algorithms, Nordic Journal of Computing 2 (1995), no.2, pp. 146–180.

    Google Scholar 

  20. P.C. Kanellakis, and A.A. Shvartsman, Efficient parallel algorithms can be made robust, Distributed Computing, 5 (1992), pp. 201–217.

    Google Scholar 

  21. R.M. Karp, and V. Ramachandran, Parallel algorithms for shared-memory machines, in “Handbook of Theoretical Computer Science,” ed. J. van Leeuwen, Elsevier (1990), vol. A, pp. 869–941.

    Google Scholar 

  22. Z. M. Kedem, K. V. Palem, A. Raghunathan, and P. Spirakis, Combining tentative and definite executions for very fast dependable parallel computing, in Proceedings of the 23rd Annual ACM Symposium on Theory of Computing (1991), pp. 381–390.

    Google Scholar 

  23. Z. M. Kedem, K. V. Palem, and P. Spirakis, Efficient robust parallel computations, in Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, (1990), pp. 138–148.

    Google Scholar 

  24. A. Lubotzky, R. Philips, and P. Sarnak, Ramanujan graphs, Combinatorica (1988), vol. 8, no. 3, pp. 261–77.

    Article  Google Scholar 

  25. Ch. Martel, R. Subramanian, and A. Park, In Proceedings of 31st Annual Symposium on Foundations of Computer Science (1990), pp. 590–599.

    Google Scholar 

  26. Mc Diarmid, On the Method of Bounded Differences, in J. Siemon, ed., “Surveys in Combinatorics”, Cambridge University Press (1989), London Math. Soc. Lecture Note Series 141, pp. 148–188.

    Google Scholar 

  27. F. Meyer auf der Heide, Hashing strategies for simulating shared memory on distributed memory machines, in Proceedings of the 1st Heinz Nixdorf Symposium “Parallel Architectures and their Efficient Use” ed. F. Meyer auf der Heide. B. Monien, A.L. Rosenberg, Paderborn, Germany (1992), Springer LNCS 678, pp. 20–29.

    Google Scholar 

  28. M.O. Rabin, Efficient dispersal of information for security, load balancing, and fault tolerance, Journal of ACM, 36 (1989), pp. 335–348.

    Article  Google Scholar 

  29. A. Siegel, On Universal Classes of Fast High Performance Hash Functions, Their Time-Space Trade-off, and Their Applications, In Proceedings of 30th Annual Symposium on Foundations of Computer Science (1989), pp. 20–25.

    Google Scholar 

  30. J. Schmidt, A. Siegel and A. Srinivasan, Chernoff-Hoeffding Bounds for Applications with Limited Independence, in Proceedings of the Symposium on Discrete Algorithms (1993), pp. 331–340.

    Google Scholar 

  31. M. Sipser, and D. A. Spielman, Expander Codes, in Proceedings 35th Annual Symposium on Foundations of Computer Science (1994), pp. 566–576.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Max-Planck Institut für Informatik, Im Stadtwald, D-66123, Saarbrücken

    Leszek Gąsieniec

  2. Computer Science Department, Stanford University, Stanford

    Piotr Indyk

Authors
  1. Leszek Gąsieniec
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Piotr Indyk
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bogdan S. Chlebus Ludwik Czaja

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gąsieniec, L., Indyk, P. (1997). Efficient parallel computing with memory faults. In: Chlebus, B.S., Czaja, L. (eds) Fundamentals of Computation Theory. FCT 1997. Lecture Notes in Computer Science, vol 1279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036183

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-69529-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation