Achieving optimal CRCW PRAM fault-tolerance

DOI10.1016/0020-0190(91)90156-CzbMath0735.68009OpenAlexW2035078436MaRDI QIDQ1182119

Alexander A. Schwarzmann

Publication date: 27 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90156-c

zbMATH Keywords

fault-toleranceCRCW PRAM

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (6)

Fast deterministic simulation of computations on faulty parallel machines ⋮ The complexity of synchronous iterative Do-All with crashes ⋮ Reliable computations on faulty EREW PRAM ⋮ Efficient parallel algorithms can be made robust ⋮ An efficient write-all algorithm for fail-stop PRAM without initialized memory ⋮ A tight analysis and near-optimal instances of the algorithm of Anderson and Woll

Cites Work

• Unnamed Item
• Efficient parallel algorithms can be made robust
• Probabilistic analysis of a network resource allocation algorithm
• Parallelism in random access machines

This page was built for publication: Achieving optimal CRCW PRAM fault-tolerance