The causal ordering abstraction and a simple way to implement it
From MaRDI portal
Publication:1183422
DOI10.1016/0020-0190(91)90008-6zbMath0748.68026OpenAlexW1973943007MaRDI QIDQ1183422
Sam Toueg, André Schiper, Michel Raynal
Publication date: 28 June 1992
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00075427/file/RR-1132.pdf
Related Items (17)
An optimal algorithm for distributed snapshots with causal message ordering ⋮ Detecting causal relationships in distributed computations: In search of the holy grail ⋮ A limitation of vector timestamps for reconstructing distributed computations ⋮ On the diversity of asynchronous communication ⋮ On the interconnection of message passing systems ⋮ Communication Patterns and Input Patterns in Distributed Computing ⋮ A framework for viewing atomic events in distributed computations ⋮ Efficient dependency tracking for relevant events in concurrent systems ⋮ Implementation of hierarchical F-channels for high-performance distributed computing ⋮ Synchronous, asynchronous, and causally ordered communication ⋮ Necessary and sufficient conditions on information for causal message ordering and their optimal implementation ⋮ Set-constrained delivery broadcast: a communication abstraction for Read/write implementable distributed objects ⋮ Byzantine-tolerant causal broadcast ⋮ Recording distributed snapshots based on causal order of message delivery ⋮ Crash-tolerant causal broadcast in \(O(n)\) messages ⋮ GUARANTEED MUTUALLY CONSISTENT CHECKPOINTING IN DISTRIBUTED COMPUTATIONS ⋮ Bounded time-stamping in message-passing systems
Cites Work
This page was built for publication: The causal ordering abstraction and a simple way to implement it
