Skip to main content

PRAM computations resilient to memory faults

  • Conference paper
  • First Online:
Algorithms — ESA '94 (ESA 1994)

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

Included in the following conference series:

  • 151 Accesses

Abstract

PRAMs with faults in their shared memory are investigated. Efficient general simulations on such machines of algorithms designed for fully reliable PRAMs are developed.

The PRAM we work with is the Concurrent-Read Concurrent-Write (CRCW) variant. Two possible settings for error occurrence are considered: the errors may be either static (once a memory cell is checked to be operational it remains so during the computation) or dynamic (a potentially faulty cell may crash at any time, the total number of such cells being bounded). A simulation consists of two phases: memory formatting and the proper part done in a step-by-step way. For each error setting (static or dynamic), two simulations are presented: one with a O(1)-time per-step cost, the other with a O(log n)-time per-step cost. The other parameters of these simulations (number of processors, memory size, formatting time) are shown in table 1 in section 6. The simulations are randomized and Monte Carlo: they always operate within the given time bounds, and are guaranteed to be correct with a large probability.

This research was partially supported by EC Cooperative Action IC-1000 (project ALTEC: Algorithms for Future Technologies).

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Google Scholar 

  2. A. Aggarwal, A.K. Chandra, and M. Snir, On Communication Latency in PRAM Computations, Proc. 1st Ann. ACM Symposium on Parallel Algorithms and Architectures (1989), 11–21.

    Google Scholar 

  3. Y. Aumann, Z.M. Kedem, K.V. Palem, and M.O. Rabin, Highly Efficient Asynchronous Execution of Large-Grained Parallel Programs, Proc. 34th Ann. Symposium on Foundations of Computer Science (1993), 271–280.

    Google Scholar 

  4. N. Alon, J. Bruck, J. Naor, M. Naor, and R.M. Roth, Construction of Asymptotically Good Low-Rate Error-Correcting Codes through Pseudo-Random Graphs, IEEE Trans. Inf. Theory, 38 (1992), 509–516.

    Article  Google Scholar 

  5. B.S. Chlebus, K. Diks, T. Hagerup, and T. Radzik, New Simulations between CRCW PRAMs, Proc. 7th International Conference on Fundamentals of Computation Theory (1989), 95–104, Springer LNCS 380.

    Google Scholar 

  6. R. Cole, and O. Zajicek, The APRAM: Incorporating Asynchrony into the PRAM Model, Proc. 2nd Ann. ACM Symposium on Parallel Algorithms and Architectures (1990), 158–168.

    Google Scholar 

  7. K. Diks, and A. Pelc, Reliable Computations on Faulty EREW PRAM, manuscript, 1993.

    Google Scholar 

  8. F. Meyer auf der Heide, Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines, Proc. of the 1st Heinz Nixdorf Symposium ”Parallel Architectures and their Efficient Use,” (1992), 20–29, Springer LNCS 678.

    Google Scholar 

  9. P.B. Gibbons, A More Practical PRAM Model, Proc. 2nd Ann. ACM Symposium on Parallel Algorithms and Architectures (1990), 169–178.

    Google Scholar 

  10. A.M. Gibbons and W. Rytter, ”Efficient Parallel Algorithms,” Cambridge University Press, 1988.

    Google Scholar 

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

    Google Scholar 

  12. JáJá, ”An Introduction to Parallel Algorithms,” Addison-Wesley, 1992.

    Google Scholar 

  13. P. Jayanti, T.D. Chandra, and S. Toueg, Fault-tolerant Wait-free Shared Objects, Proc. 33rd Ann. Symposium on Foundations of Computer Science (1992), 157–166.

    Google Scholar 

  14. J. Justesen, On the Complexity of Decoding Reed-Solomon Codes, IEEE Trans. Inf. Theory, 22 (1976), 237–238.

    Article  MATH  MathSciNet  Google Scholar 

  15. P.C. Kanellakis and A.A. Shvartsman, Efficient Parallel Algorithms Can Be Made Robust, Distributed Computing, 5 (1992), 201–217.

    Article  Google Scholar 

  16. Z.M. Kedem, K.V. Palem, and P.G. Spirakis, Efficient Robust Parallel Computations, Proc. 22nd ACM Symp. on Theory of Computing (1990), 138–148.

    Google Scholar 

  17. Ch. Martel, R. Subramonian, and A. Park, Asynchronous PRAMs Are (Almost) as Good as Synchronous PRAMs, Proc. 31st Ann. Symposium on Foundations of Computer Science (1990), 590–599.

    Google Scholar 

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

    Google Scholar 

  19. F.J. MacWilliams, and N.J.A Sloane, ”The Theory of Error-Correcting Codes,” North-Holland, 1977.

    Google Scholar 

  20. N. Nishimura, Asynchronous Shared Memory Parallel Computation, Proc. 1st Ann. ACM Symposium on Parallel Algorithms and Architectures (1989), 76–84.

    Google Scholar 

  21. M.O. Rabin, Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance, Journal of ACM, 36 (1989), 335–348.

    Article  MATH  MathSciNet  Google Scholar 

  22. D.V. Sarwate, On the Complexity of Decoding Goppa Codes, IEEE Trans. Inf. Theory, 23 (1976), 515–516.

    MathSciNet  Google Scholar 

  23. Y. Sugiyama, M. Kosahara, S. Hirasawa, and T. Namekawa, An Erasures and Error Decoding Algorithm for Goppa Codes, IEEE Trans. Inf. Theory, 22 (1976), 238–241.

    Google Scholar 

  24. L.G. Valiant, General Purpose Parallel Architectures, in J. van Leeuwen, ed., ”Handbook of Theoretical Computer Science,” vol. A, 943–971, Elsevier, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jan van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chlebus, B.S., Gambin, A., Indyk, P. (1994). PRAM computations resilient to memory faults. In: van Leeuwen, J. (eds) Algorithms — ESA '94. ESA 1994. Lecture Notes in Computer Science, vol 855. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0049426

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58434-6

  • Online ISBN: 978-3-540-48794-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics