Time-efficient read/write register in crash-prone asynchronous message-passing systems

DOI10.1007/S00607-018-0615-8zbMath1458.68018arXiv1601.04820OpenAlexW2924938447WikidataQ129894526 ScholiaQ129894526MaRDI QIDQ2218424

Michel Raynal, Matthieu Roy, Achour Mostefaoui

Publication date: 15 January 2021

Published in: Computing (Search for Journal in Brave)

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

zbMATH Keywords

concurrencyasynchronous message-passing systemprocess crash failureatomic read/write registerfast operationsynchronous behaviortime-efficient operation

Mathematics Subject Classification ID

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

Related Items (2)

Brief Announcement: The MBroadcast Abstraction ⋮ Set-constrained delivery broadcast: a communication abstraction for Read/write implementable distributed objects

Cites Work

• Unnamed Item
• Unnamed Item
• On interprocess communication. I: Basic formalism
• Distributed Algorithms for Message-Passing Systems
• Concurrent Programming: Algorithms, Principles, and Foundations
• Sharing memory robustly in message-passing systems
• On Quiescent Reliable Communication
• Fault-Tolerant Message-Passing Distributed Systems
• Brief Announcement
• Two-Bit Messages are Sufficient to Implement Atomic Read/Write Registers in Crash-prone Systems
• Fast Access to Distributed Atomic Memory
• How fast can a distributed atomic read be?
• On Computable Numbers, with an Application to the Entscheidungsproblem

This page was built for publication: Time-efficient read/write register in crash-prone asynchronous message-passing systems