Set-constrained delivery broadcast: a communication abstraction for read/write implementable distributed objects

DOI10.1016/J.TCS.2021.06.044MaRDI QIDQ2232592zbMATH OpenOpenAlexFDO

Authors Damien Imbs, Matthieu Perrin, Michel Raynal, Achour Mostefaoui

Publication date 6 October 2021

Published in Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

abstractionsequential consistencyasynchronous systemcommunication abstractionmessage-passing systemprocess crashlinearizabilitydistributed taskcommunication patternconflict-free replicated data typedesign simplicityRead/write atomic registersnapshot object

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Implementing set objects in dynamic distributed systems
• Which broadcast abstraction captures \(k\)-set agreement?
• Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement
• k-Immediate Snapshot and x-Set Agreement: How Are They Related?
• Implementing sequentially consistent shared objects using broadcast and point-to-point communication

Cites work

• An optimal multi-writer snapshot algorithm
• Appraising two decades of distributed computing theory research
• Atomic Snapshots in O (n log n) Operations
• Atomic snapshots of shared memory
• Atomic snapshots using lattice agreement
• Causal memory: definitions, implementation, and programming
• Concurrent programming: algorithms, principles, and foundations.
• Fault-tolerant message-passing distributed systems. An algorithmic approach
• Generalized lattice agreement
• Help when needed, but no more: efficient read/write partial snapshot
• How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
• Impossibility of distributed consensus with one faulty process
• Linear space bootstrap communication schemes
• On interprocess communication. I: Basic formalism
• SOFSEM 2005: Theory and Practice of Computer Science
• Sharing memory robustly in message-passing systems
• Software transactional memory
• The causal ordering abstraction and a simple way to implement it
• Time-efficient read/write register in crash-prone asynchronous message-passing systems
• Unreliable failure detectors for reliable distributed systems
• Which broadcast abstraction captures \(k\)-set agreement?

Cited in

(3)

• Implementing set objects in dynamic distributed systems
• Brief Announcement: The MBroadcast Abstraction
• Implementing sequentially consistent shared objects using broadcast and point-to-point communication

This page was built for publication: Set-constrained delivery broadcast: a communication abstraction for read/write implementable distributed objects

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