A locality-driven atomic group checkpoint protocol

This paper explores the use of locality of dependencies in large-scale distributed systems towards developing efficient checkpoint strategies. Dependencies among processes evolve into message interactions, which often spread and affect recovery dependencies and logging requirements. On the other hand, message interactions are usually localized within small subregions formed in space and time. Aiming at both minimizing message logging and localizing recovery,effect, we propose a strategy that forms group checkpoints around such regions and meanwhile selectively logs inter-region messages. A simple and efficient Atomic Group Checkpoint (AGC) protocol is developed based on the locality information of a distributed computation, e.g., in agent communication protocol sessions in multi-agent systems. Atomicity guarantees consistency of group checkpoint and uniformity of group logging, and hence minimizes logging overhead. The correctness of the A GC protocol is analyzed and proved through a generic Checkpoint Dependency Graph (CDG) model, which captures the recovery dependency relations among checkpoints.