Brief Announcement: The MBroadcast Abstraction

DOI10.1145/3583668.3594569MaRDI QIDQ6202263zbMATH OpenFDO

Authors Achour Mostefaoui, Matthieu Perrin, Michel Raynal

Publication date 26 March 2024

Published in Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

zbMATH Keywords

characterizationasynchronyatomicityquorumcrash failuredistributed computabilitymessage-passingbroadcast abstractionread/write registermessage patternread/write patterntwo-process communication

Mathematics Subject Classification ID

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

Cites work

• Causal memory: definitions, implementation, and programming
• Efficient and Robust Sharing of Memory in Message-Passing Systems
• Fault-tolerant message-passing distributed systems. An algorithmic approach
• From wait-free to arbitrary concurrent solo executions in colorless distributed computing
• Set-constrained delivery broadcast: a communication abstraction for read/write implementable distributed objects
• Sharing memory robustly in message-passing systems
• Time-efficient read/write register in crash-prone asynchronous message-passing systems
• Two-bit messages are sufficient to implement atomic read/write registers in crash-prone systems

This page was built for publication: Brief Announcement: The MBroadcast Abstraction

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