Atomic read/write memory in signature-free Byzantine asynchronous message-passing systems

DOI10.1007/s00224-016-9699-8zbMath1371.68040arXiv1604.08161OpenAlexW2288596753MaRDI QIDQ2398211

Michel Raynal, Claude Jard, Matoula Petrolia, Achour Mostefaoui

Publication date: 15 August 2017

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.08161

zbMATH Keywords

linearizabilityasynchronous message-passing systematomic read/write registerByzantine processreliable broadcast abstraction

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• On interprocess communication. I: Basic formalism
• Distributed Algorithms for Message-Passing Systems
• The complexity of robust atomic storage
• Concurrent Programming: Algorithms, Principles, and Foundations
• Axioms for memory access in asynchronous hardware systems
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• Efficient and Robust Sharing of Memory in Message-Passing Systems
• Reliable Shared Memory Abstraction on Top of Asynchronous Byzantine Message-Passing Systems

This page was built for publication: Atomic read/write memory in signature-free Byzantine asynchronous message-passing systems