An optimal algorithm for distributed snapshots with causal message ordering
- 27 June 1994
- journal article
- Published by Elsevier BV in Information Processing Letters
- Vol. 50 (6), 311-316
- https://doi.org/10.1016/0020-0190(94)00055-7
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Recording distributed snopshots based on causal order of message deliveryInformation Processing Letters, 1992
- The causal ordering abstraction and a simple way to implement itInformation Processing Letters, 1991
- Lightweight causal and atomic group multicastACM Transactions on Computer Systems, 1991
- Flush primitives for asynchronous distributed systemsInformation Processing Letters, 1990
- On distributed snapshotsInformation Processing Letters, 1987
- Distributed snapshotsACM Transactions on Computer Systems, 1985
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978