Atomic snapshots of shared memory, Journal of the ACM, vol.40, issue.4, pp.873-890, 1993. ,
DOI : 10.1145/153724.153741
Multi-writer composite registers, Distributed Computing, pp.175-195, 1994. ,
DOI : 10.1007/BF02280833
Efficient and Robust Sharing of Memory in Message-Passing Systems, Journal of Algorithms, vol.34, issue.1, pp.109-127, 2000. ,
DOI : 10.1006/jagm.1999.1025
Sharing memory robustly in message passing systems, Journal of the ACM, vol.42, issue.1, pp.121-132, 1995. ,
Partial snapshot objects, Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures, SPAA '08, pp.336-343, 2008. ,
DOI : 10.1145/1378533.1378591
) Operations, SIAM Journal on Computing, vol.27, issue.2, pp.319-340, 1998. ,
DOI : 10.1137/S0097539795279463
Distributed computing: fundamentals, simulations and advanced topics, p.414, 2004. ,
DOI : 10.1002/0471478210
Distributed snapshots: determining global states of distributed systems, ACM Transactions on Computer Systems, vol.3, issue.1, pp.63-75, 1985. ,
DOI : 10.1145/214451.214456
Consistent detection of global predicates, Proc. ACM/ONR Workshop on Parallel and Distributed Debugging, pp.163-173, 1991. ,
Termination detection for diffusing computations, Information Processing Letters, vol.11, issue.1, pp.1-4, 1980. ,
DOI : 10.1016/0020-0190(80)90021-6
Fast Access to Distributed Atomic Memory, SIAM Journal on Computing, vol.39, issue.8, pp.3752-3783, 2010. ,
DOI : 10.1137/090757010
Communication-induced determination of consistent snapshots, IEEE Transactions on Parallel and Distributed Systems, vol.10, issue.9, pp.865-877, 1999. ,
DOI : 10.1109/71.798312
Wait-free synchronization, ACM Transactions on Programming Languages and Systems, vol.13, issue.1, pp.124-149, 1991. ,
DOI : 10.1145/114005.102808
Linearizability: a correctness condition for concurrent objects, ACM Transactions on Programming Languages and Systems, vol.12, issue.3, pp.463-492, 1990. ,
DOI : 10.1145/78969.78972
Help when needed, but no more: Efficient read/write partial snapshot, Journal of Parallel and Distributed Computing, vol.72, issue.1, pp.1-12, 2012. ,
DOI : 10.1016/j.jpdc.2011.08.005
URL : https://hal.archives-ouvertes.fr/inria-00440392
Linear-time snapshot using multi-writer multi-reader registers, Proc. 8th Int'l Workshop on Distributed Algorithms (WDAG'94), Springer LNCS 1857, pp.130-140, 1994. ,
DOI : 10.1007/BFb0020429
On distributed snapshots, Information Processing Letters, vol.25, issue.3, pp.153-168, 1987. ,
DOI : 10.1016/0020-0190(87)90125-6
Time, clocks, and the ordering of events in a distributed system, Communications of the ACM, vol.21, issue.7, pp.558-565, 1978. ,
DOI : 10.1145/359545.359563
On interprocess communication, Distributed Computing, vol.21, issue.2, pp.77-85, 1986. ,
DOI : 10.1007/BF01786227
Distributed algorithms, 1996. ,
Axioms for memory access in asynchronous hardware systems, ACM Transactions on Programming Languages and Systems, vol.8, issue.1, pp.142-153, 1986. ,
DOI : 10.1145/5001.5007
Time-efficient read/write register in crash-prone asynchronous messagepassing systems, Proc. 4th Int'l Conference on Networked Systems (NETYS'16), 2016. ,
Two-Bit Messages are Sufficient to Implement Atomic Read/Write Registers in Crash-prone Systems, Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC '16, 2016. ,
DOI : 10.1145/2933057.2933095
Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed Systems, Synthesis Lectures on Distributed Computing Theory, vol.1, issue.1, 2010. ,
DOI : 10.2200/S00236ED1V01Y201004DCT002
URL : https://hal.archives-ouvertes.fr/inria-00543036
Distributed algorithms for message-passing systems, 2013. ,
DOI : 10.1007/978-3-642-38123-2
URL : https://hal.archives-ouvertes.fr/hal-00922219
Concurrent programming: algorithms, principles and foundations, 2013. ,
DOI : 10.1007/978-3-642-32027-9
URL : https://hal.archives-ouvertes.fr/hal-00922217
Implementing shared registers in asynchronous message-passing systems. Springer Encyclopedia of Algorithms, pp.400-403, 2008. ,
Synchronization algorithms and concurrent programming. Pearson Prentice-Hall, 423 pages, 2006. ,