GUARANTEED MUTUALLY CONSISTENT CHECKPOINTING IN DISTRIBUTED COMPUTATIONS
From MaRDI portal
Publication:5249033
DOI10.1142/S0129054100000089zbMath1319.68093MaRDI QIDQ5249033
Yuan Miao, Chengzheng Sun, Zhong-hua Yang, Abdul Sattar, Yanyan Yang
Publication date: 29 April 2015
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14)
Cites Work
- The causal ordering abstraction and a simple way to implement it
- Consistent global checkpoints based on direct dependency tracking
- Detecting causal relationships in distributed computations: In search of the holy grail
- Checkpointing and Rollback-Recovery for Distributed Systems
- State Restoration in Systems of Communicating Processes
- Time, clocks, and the ordering of events in a distributed system
This page was built for publication: GUARANTEED MUTUALLY CONSISTENT CHECKPOINTING IN DISTRIBUTED COMPUTATIONS