Introduction to Reliable and Secure Distributed Programming

DOI10.1007/978-3-642-15260-3zbMath1208.68001DBLPbooks/daglib/0025983OpenAlexW1794148987WikidataQ56557164 ScholiaQ56557164MaRDI QIDQ3078444

Christian Cachin, Rachid Guerraoui, Luis Henrique Rodrigues

Publication date: 21 February 2011

Full work available at URL: https://doi.org/10.1007/978-3-642-15260-3

zbMATH Keywords

distributed systemsdistributed algorithmsshared memoryconsensusreliable broadcastByzantine consensusdistributed programming abstractionsextensions of consensus

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Distributed algorithms (68W15)

Related Items (18)

Unnamed Item ⋮ Generalized Paxos made Byzantine (and less complex) ⋮ A distributed leader election algorithm in crash-recovery and omissive systems ⋮ Genuinely distributed Byzantine machine learning ⋮ Quick order fairness ⋮ Asynchronous Byzantine reliable broadcast with a message adversary ⋮ Permissionless and asynchronous asset transfer ⋮ Reaching consensus in the presence of contention-related crash failures ⋮ Uniform reliable broadcast in anonymous distributed systems with fair lossy channels ⋮ On the Amortized Communication Complexity of Byzantine Broadcast ⋮ On the Validity of Consensus ⋮ Specification and space complexity of collaborative text editing ⋮ Byzantine-tolerant causal broadcast ⋮ Doing-it-all with bounded work and communication ⋮ Crash-tolerant causal broadcast in \(O(n)\) messages ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Asynchronous reconfiguration with Byzantine failures

This page was built for publication: Introduction to Reliable and Secure Distributed Programming