Communication Patterns and Input Patterns in Distributed Computing

DOI10.1007/978-3-319-25258-2_1zbMath1471.68033OpenAlexW2289941349MaRDI QIDQ3460703

Michel Raynal

Publication date: 8 January 2016

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-25258-2_1

zbMATH Keywords

causalitycheckpointingconsensuserror-correcting codecrash failureagreement probleminput vectorByzantine failurecausal message ordermessage patternzigzag path

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (1)

About informatics, distributed computing, and our job: a personal view

Cites Work

• Unnamed Item
• Unnamed Item
• Systolic algorithms as programs
• The causal ordering abstraction and a simple way to implement it
• Interval consistency of asynchronous distributed computations
• Rollback-dependency trackability: A minimal characterization and its protocol
• Synchronous condition-based consensus
• Distributed Algorithms for Message-Passing Systems
• Signature-free asynchronous byzantine consensus with t < n/3 and o(n ² ) messages
• Concurrent Programming: Algorithms, Principles, and Foundations
• The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement
• Conditions on input vectors for consensus solvability in asynchronous distributed systems
• Impossibility of distributed consensus with one faulty process
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• Time, clocks, and the ordering of events in a distributed system
• Unreliable failure detectors for reliable distributed systems
• The weakest failure detector for solving consensus

This page was built for publication: Communication Patterns and Input Patterns in Distributed Computing