Efficient test \& set constructions for faulty shared memory

DOI10.1016/S0020-0190(97)00036-7zbMath1336.68017MaRDI QIDQ287031

Michael Merritt, Ariel Orda

Publication date: 26 May 2016

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

zbMATH Keywords

parallel algorithmsfault tolerancedistributed computing

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items

Efficient test \& set constructions for faulty shared memory

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient test \& set constructions for faulty shared memory
• On interprocess communication. II: Algorithms
• N-process mutual exclusion with bounded waiting by 4. log//2N-valued shared variable
• Constructing 1-writer multireader multivalued atomic variables from regular variables
• Computing with faulty shared objects