Fault-tolerant message-passing distributed systems. An algorithmic approach

DOI10.1007/978-3-319-94141-7MaRDI QIDQ5237451zbMATHOpenAlexFDO

Authors Michel Raynal

Publication date 18 October 2019

Full work available at URL https://doi.org/10.1007/978-3-319-94141-7

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms (68W40) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14)

Recommendations

• Introduction to Reliable and Secure Distributed Programming
• Distributed Systems
• Introduction to Reliable Distributed Programming
• Distributed systems. An algorithmic approach
• Distributed Computing

Cited in

(31)

• Synchronous \(t\)-resilient consensus in arbitrary graphs
• Distributed Systems
• Reaching consensus in the presence of contention-related crash failures
• Asynchronous Byzantine reliable broadcast with a message adversary
• Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast
• Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast
• Message-optimal protocols for fault-tolerant broadcasts/multicasts in distributed systems with crash failures
• Good-case early-stopping latency of synchronous Byzantine reliable broadcast: the deterministic case
• Self-stabilizing indulgent zero-degrading binary consensus
• Brief Announcement: The MBroadcast Abstraction
• Self-stabilizing multivalued consensus in asynchronous crash-prone systems
• How to Simulate Message-Passing Algorithms in Mobile Agent Systems with Faults
• Process-commutative distributed objects: from cryptocurrencies to Byzantine-fault-tolerant CRDTs
• Optimal algorithms for synchronous Byzantine \(k\)-set agreement
• Optimal algorithms for synchronous Byzantine \(k\)-set agreement
• Contention-related crash failures: definitions, agreement algorithms, and impossibility results
• Distributed Algorithms for Message-Passing Systems
• Fault-tolerant graph realizations in the congested clique
• Synchronous \(t\)-resilient consensus in arbitrary graphs
• A network-failure-tolerant message-passing system for terascale clusters
• Byzantine-tolerant causal broadcast
• A fault-tolerant message passing algorithm and its hardware implementation
• Byzantine-Tolerant Reliable Broadcast in the Presence of Silent Churn
• On the versatility of Bracha's Byzantine reliable broadcast algorithm
• Set-constrained delivery broadcast: a communication abstraction for read/write implementable distributed objects
• Reaching agreement in the presence of contention-related crash failures
• An eventually perfect failure detector for networks of arbitrary topology connected with ADD channels using time-to-live values
• A simple object that spans the whole consensus hierarchy
• Time-efficient read/write register in crash-prone asynchronous message-passing systems
• Crash-tolerant causal broadcast in \(O(n)\) messages
• About informatics, distributed computing, and our job: a personal view

This page was built for publication: Fault-tolerant message-passing distributed systems. An algorithmic approach

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