An optimal algorithm for distributed snapshots with causal message ordering

DOI10.1016/0020-0190(94)00055-7zbMath0810.68078OpenAlexW1987884672WikidataQ127771060 ScholiaQ127771060MaRDI QIDQ1330663

V. Pereyra

Publication date: 21 July 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00055-7

zbMATH Keywords

distributed systemmessage complexitycausally ordered message delivery

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Distributed algorithms (68W15)

Related Items (2)

A family of optimal termination detection algorithms ⋮ Distributed snapshots foradhocnetwork systems

Cites Work

• Flush primitives for asynchronous distributed systems
• On distributed snapshots
• The causal ordering abstraction and a simple way to implement it
• Recording distributed snapshots based on causal order of message delivery
• Time, clocks, and the ordering of events in a distributed system

This page was built for publication: An optimal algorithm for distributed snapshots with causal message ordering