Introduction to Reliable and Secure Distributed Programming

DOI10.1007/978-3-642-15260-3MaRDI QIDQ3078444zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Christian Cachin, Rachid Guerraoui, Luis Rodrigues

Publication date 21 February 2011

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

zbMATH Keywords

Byzantine consensusconsensusdistributed algorithmsdistributed programming abstractionsdistributed systemsextensions of consensusreliable broadcastshared memory

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)

Recommendations

• Introduction to Reliable Distributed Programming
• Distributed programming. Theory and practice.
• Programming distributed computing systems. A foundational approach
• Introduction to Distributed Algorithms
• Distributed programming paradigms with cryptography applications

Cited in

(37)

• Byzantine-tolerant causal broadcast
• Asynchronous reconfiguration with Byzantine failures
• Genuinely distributed Byzantine machine learning
• Uniform reliable broadcast in anonymous distributed systems with fair lossy channels
• Specification and space complexity of collaborative text editing
• Crash-tolerant causal broadcast in \(O(n)\) messages
• Generalized Paxos made Byzantine (and less complex)
• Efficient and modular consensus-free reconfiguration for fault-tolerant storage
• A distributed leader election algorithm in crash-recovery and omissive systems
• scientific article; zbMATH DE number 2013828 (Why is no real title available?)
• Reliable Distributed Systems
• scientific article; zbMATH DE number 839543 (Why is no real title available?)
• scientific article; zbMATH DE number 7561259 (Why is no real title available?)
• Federated Byzantine quorum systems
• Introduction to Reliable Distributed Programming
• Fault-tolerant message-passing distributed systems. An algorithmic approach
• Doing-it-all with bounded work and communication
• 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
• On the Amortized Communication Complexity of Byzantine Broadcast
• On the Validity of Consensus
• Byzantine-Tolerant Reliable Broadcast in the Presence of Silent Churn
• Asynchronous reconfiguration with Byzantine failures
• Good-case early-stopping latency of synchronous Byzantine reliable broadcast: the deterministic case
• Liveness and latency of Byzantine state-machine replication
• Asymmetric distributed trust
• Dynamic Byzantine reliable broadcast
• Semiframes: the algebra of semitopologies and actionable coalitions
• Swiper: a new paradigm for efficient weighted distributed protocols
• Crash-stop failures in asynchronous multiparty session types
• Creek: a single-order mixed-consistency replication scheme
• Centroid approximation with multidimensional approximate agreement protocols
• Simplicial belief
• The economic limits of permissionless consensus
• A framework for establishing Strong Eventual Consistency for Conflict-free Replicated Datatypes

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

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