Reliable computations on faulty EREW PRAM

DOI10.1016/0304-3975(95)00186-7MaRDI QIDQ671425zbMATH OpenOpenAlexFDO

Authors Krzysztof Diks, Andrzej Pelc

Publication date 27 February 1997

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(95)00186-7

zbMATH Keywords

parallel random access machinereliable computingEREW PRAM algorithmsfault-prone machine

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Recommendations

• Efficient parallel computing with memory faults
• scientific article; zbMATH DE number 794259
• Efficient parallel algorithms can be made robust

Cites work

• scientific article; zbMATH DE number 4064468 (Why is no real title available?)
• scientific article; zbMATH DE number 43583 (Why is no real title available?)
• scientific article; zbMATH DE number 107951 (Why is no real title available?)
• scientific article; zbMATH DE number 1142306 (Why is no real title available?)
• A guided tour of Chernoff bounds
• Achieving optimal CRCW PRAM fault-tolerance
• An efficient write-all algorithm for fail-stop PRAM without initialized memory
• Efficient parallel algorithms can be made robust
• Fault Tolerant Sorting Networks
• Parallelism in random access machines

Cited in

(3)

• Efficient parallel algorithms can be made robust
• Reliable Computing with GNU MPFR
• Efficient parallel computing with memory faults

This page was built for publication: Reliable computations on faulty EREW PRAM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q671425)