Reliable computations on faulty EREW PRAM

DOI10.1016/0304-3975(95)00186-7zbMath0874.68116OpenAlexW2013316536MaRDI QIDQ671425

Andrzej Pelc, Krzysztof Diks

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)

Related Items (1)

Efficient parallel computing with memory faults

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A guided tour of Chernoff bounds
• Achieving optimal CRCW PRAM fault-tolerance
• Efficient parallel algorithms can be made robust
• An efficient write-all algorithm for fail-stop PRAM without initialized memory
• Fault Tolerant Sorting Networks
• Parallelism in random access machines

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