dc.contributor.author | Aggarwal, Deepanker | |
dc.contributor.author | Kiehn, Astrid | |
dc.date.accessioned | 2015-09-10T09:41:32Z | |
dc.date.available | 2015-09-10T09:41:32Z | |
dc.date.issued | 2015-09-10T09:41:32Z | |
dc.identifier.uri | https://repository.iiitd.edu.in/jspui/handle/123456789/283 | |
dc.description.abstract | The well-known coordinated snapshot algorithm of mutable checkpointing [7{9] is studied. We equip it with a concise formal model and analyze its operational behavior via an invariant characterizing the snapshot computation. By this we obtain a clear understanding of the intermediate behavior and a correctness proof of the fi nal snapshot based on a strong notion of consistency (reachability within the partial order representing the underlying computation). The formal model further enables a comparison with the blocking queue algorithm [13] introduced for the same scenario and with the same objective. From a broader perspective, we advocate the use of formal semantics to formulate and prove correctness of distributed algorithms. | en_US |
dc.language.iso | en_US | en_US |
dc.relation.ispartofseries | IIITD-TR-2015-008 | |
dc.subject | Snapshot | en_US |
dc.subject | Checkpointing | en_US |
dc.subject | Consistency | en_US |
dc.subject | Distributed computing | en_US |
dc.title | Analyzing mutable checkpointing via invariants | en_US |
dc.type | Technical Report | en_US |