Synchronous, asynchronous, and causally ordered communication

DOI10.1007/S004460050018MaRDI QIDQ5137015zbMATH OpenOpenAlexFDO

Authors Bernadette Charron-Bost, Friedemann Mattern, Gerard Tel

Publication date 30 November 2020

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s004460050018

zbMATH Keywords

asynchronous communicationcausal ordercausality relationcommunicationdistributed computationdistributed systemdistributed termination detectionmessage passingsynchronous communication

Mathematics Subject Classification ID

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

Recommendations

• Verifying programs that use causally-ordered message-passing
• scientific article; zbMATH DE number 3963184
• Synchrony versus causality in distributed systems
• On the diversity of asynchronous communication
• The causal ordering abstraction and a simple way to implement it

Cites work

• A calculus of communicating systems
• An axiomatic definition of synchronization primitives
• Communicating sequential processes
• Derivation of a termination detection algorithm for distributed computations
• Distributed processes
• Flush primitives for asynchronous distributed systems
• scientific article; zbMATH DE number 45145 (Why is no real title available?)
• scientific article; zbMATH DE number 47171 (Why is no real title available?)
• scientific article; zbMATH DE number 194916 (Why is no real title available?)
• scientific article; zbMATH DE number 944424 (Why is no real title available?)
• scientific article; zbMATH DE number 6157242 (Why is no real title available?)
• scientific article; zbMATH DE number 1390337 (Why is no real title available?)
• Process Algebra
• Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP
• The causal ordering abstraction and a simple way to implement it
• The multiway rendezvous
• Time, clocks, and the ordering of events in a distributed system
• Using message passing for distributed programming: proof rules and disciplines
• Verifying programs that use causally-ordered message-passing

Cited in

(26)

• A framework for viewing atomic events in distributed computations
• The causal ordering abstraction and a simple way to implement it
• Verifying programs that use causally-ordered message-passing
• A modular framework for verifying versatile distributed systems
• Behavioural semantics for asynchronous components
• Multiparty half-duplex systems and synchronous communications
• A limitation of vector timestamps for reconstructing distributed computations
• Synchrony versus causality in distributed systems
• On the diversity of asynchronous communication
• Asynchronous message orderings beyond causality
• On deciding synchronizability for asynchronously communicating systems
• Beyond Lamport's happened-before: on the role of time bounds in synchronous systems
• Efficiency of Synchronous Versus Asynchronous Distributed Systems
• On the microscopic view of time and messages
• A simple characterization of asynchronous computations
• scientific article; zbMATH DE number 915978 (Why is no real title available?)
• The inhibition spectrum and the achievement of causal consistency
• Necessary and sufficient conditions on information for causal message ordering and their optimal implementation
• On the axiomatizability of some first-order spatio-temporal theories
• Distributed Computing
• Equations for asynchronous message passing
• Guessing the Buffer Bound for k-Synchronizability
• Asymptotic (a)synchronism sensitivity and complexity of elementary cellular automata
• Weakly synchronous systems with three machines are Turing powerful
• Synchronisability in mailbox communication
• Communication patterns in distributed computations

This page was built for publication: Synchronous, asynchronous, and causally ordered communication

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