Stabilizing causal deterministic merge

DOI10.1007/3-540-45438-1_13MaRDI QIDQ4446609zbMATH OpenFDO

Authors Sandeep S. Kulkarni, D. V. S. Ravikant

Publication date 2 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2194/21940183.htm

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• Efficient atomic broadcast using deterministic merge
• scientific article; zbMATH DE number 2080851
• The causal ordering abstraction and a simple way to implement it
• Necessary and sufficient conditions on information for causal message ordering and their optimal implementation
• Verifying programs that use causally-ordered message-passing

Cited in

(2)

• Controlling Variability in Split-Merge Systems
• Simplified stable merging tasks

This page was built for publication: Stabilizing causal deterministic merge

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