Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
The APRAM: incorporating asynchrony into the PRAM model
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
A bridging model for parallel computation
Communications of the ACM
Wait-free data structures in the asynchronous PRAM model
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Efficient robust parallel computations
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Combining tentative and definite executions for very fast dependable parallel computing
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Impossibility results for asynchronous PRAM (extended abstract)
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
General purpose parallel architectures
Handbook of theoretical computer science (vol. A)
Achieving optimal CRCW PRAM fault-tolerance
Information Processing Letters
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Asymptotically optimal PRAM emulation on faulty hypercubes (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
An introduction to parallel algorithms
An introduction to parallel algorithms
Information dispersal and parallel computation
Information dispersal and parallel computation
Work-optimal asynchronous algorithms for shared memory parallel computers
SIAM Journal on Computing
A survey of PRAM simulation techniques
ACM Computing Surveys (CSUR)
On the complexity of certified write-all algorithms
Journal of Algorithms
Parallel algorithms with processor failures and delays
Journal of Algorithms
Reliable computations on faulty EREW PRAM
Theoretical Computer Science
Adaptive broadcasting with faulty nodes
Parallel Computing
Algorithms for the Certified Write-All Problem
SIAM Journal on Computing
Performing Work Efficiently in the Presence of Faults
SIAM Journal on Computing
On sharing secrets and Reed-Solomon codes
Communications of the ACM
Communications of the ACM
Distributed computing: fundamentals, simulations and advanced topics
Distributed computing: fundamentals, simulations and advanced topics
Towards practical deteministic write-all algorithms
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Fault-Tolerant Parallel Computation
Fault-Tolerant Parallel Computation
Shared-Memory Simulations on a Faulty-Memory DMM
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Fault-Tolerant Shared Memory Simulations
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
On Word-Level Parallelism in Fault-Tolerant Computing
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines
Proceedings of the First Heinz Nixdorf Symposium on Parallel Architectures and Their Efficient Use
PRAM Computations Resilient to Memory Faults
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Efficient Parallel Computing with Memory Faults
FCT '97 Proceedings of the 11th International Symposium on Fundamentals of Computation Theory
An algorithm for the asynchronous Write-All problem based on process collision
Distributed Computing
Efficient parallel algorithms can be made robust
Distributed Computing
Highly efficient asynchronous execution of large-grained parallel programs
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Constructions of permutation arrays for certain scheduling cost measures
Random Structures & Algorithms
Holographic dispersal and recovery of information
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
We consider Parallel Random Access Machine (PRAM) which has some processors and memory cells faulty. The faults considered are static, i.e., once the machine starts to operate, the operational/faulty status of PRAM components does not change. We develop a deterministic simulation of a fully operational PRAM on a similar faulty machine which has constant fractions of faults among processors and memory cells. The simulating PRAM has n processors and m memory cells, and simulates a PRAM with n processors and a constant fraction of m memory cells. The simulation is in two phases: it starts with preprocessing, which is followed by the simulation proper performed in a step-by-step fashion. Preprocessing is performed in time O(({m/n}+log n)log n). The slowdown of a step-by-step part of the simulation is O(log m).