On Word-Level Parallelism in Fault-Tolerant Computing

In this paper we present several simulations of operational PRAM on PRAM with memory or processor faults. Their common property is that they rely on the ability of performing standard boolean or arithmetic operations on words consisting of many bits.

[1]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[2]  David S. Greenberg,et al.  Computing with faulty shared memory , 1992, PODC '92.

[3]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[4]  Daniel A. Spielman,et al.  Expander codes , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[5]  Daniel A. Spielman,et al.  Linear-time encodable and decodable error-correcting codes , 1995, STOC '95.

[6]  Krzysztof Diks,et al.  Reliable Computations on Faulty EREW PRAM , 1996, Theor. Comput. Sci..

[7]  Piotr Indyk,et al.  PRAM Computations Resilient to Memory Faults , 1994, ESA.

[8]  Sajal K. Das,et al.  Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992) , 1992, SIGA.

[9]  Sam Toueg,et al.  Fault-tolerant wait-free shared objects , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[10]  Alexander A. Shvartsman,et al.  Efficient parallel algorithms can be made robust , 1989, PODC '89.

[11]  Piotr Indyk,et al.  Shared-Memory Simulations on a Faulty-Memory DMM , 1996, ICALP.

[12]  Michael G. Taylor.  Reliable computation in computing systems designed from unreliable components , 1968 .

[13]  Michael L. Fredman,et al.  BLASTING through the information theoretic barrier with FUSION TREES , 1990, STOC '90.

[14]  Yonatan Aumann,et al.  Highly efficient asynchronous execution of large-grained parallel programs , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[15]  Joseph JáJá,et al.  An Introduction to Parallel Algorithms , 1992 .

[16]  Alan Siegel,et al.  On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications , 1989, 30th Annual Symposium on Foundations of Computer Science.

[17]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[18]  Friedhelm Meyer auf der Heide,et al.  Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines , 1992, Heinz Nixdorf Symposium.

[19]  Michael G. Taylor.  Reliable information storage in memories designed from unreliable components , 1968 .

[20]  A. L. Rosenberg,et al.  Parallel Architectures and Their Efficient Use , 1993, Lecture Notes in Computer Science.

[21]  Charles Clos,et al.  A study of non-blocking switching networks , 1953 .

[22]  Rajeev Raman,et al.  Sorting in linear time? , 1995, STOC '95.

[23]  Paul G. Spirakis,et al.  Efficient robust parallel computations , 2018, STOC '90.

[24]  Torben Hagerup,et al.  A Guided Tour of Chernoff Bounds , 1990, Inf. Process. Lett..