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
Efficient parallel algorithms on restartable fail-stop processors
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
It is possible to combine efficiency and fault-tolerance in many PRAM algorithms in the presence of arbitrary dynamic fail-stop processor errors. Here we describe a technique for efficient and fault-tolerant simulations of {\em arbitrary} PRAM algorithms. Given a $P$-processor PRAM algorithm, we simulate it efficiently and fault-tolerantly by a $P ^ prime$-processor CRCW PRAM algorithm, for $P ^ prime ~ \leq ~ P$. The simulation is optimal for $P ^ prime ~ \leq ~ P / \log ^ 2 P $.