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. ,
Distributed Computing: Fundamentals, Simulations and Advanced Topics, p.414, 2004. ,
DOI : 10.1002/0471478210
A simple proof of the necessity of the failure detector ?? to implement an atomic register in asynchronous message-passing systems, Information Processing Letters, vol.110, issue.4, pp.153-157, 2010. ,
DOI : 10.1016/j.ipl.2009.11.011
URL : https://hal.archives-ouvertes.fr/inria-00543125
The weakest failure detector for solving consensus, Journal of the ACM, vol.43, issue.4, pp.685-722, 1996. ,
DOI : 10.1145/234533.234549
Unreliable failure detectors for reliable distributed systems, Journal of the ACM, vol.43, issue.2, pp.225-267, 1996. ,
DOI : 10.1145/226643.226647
Tight Failure Detection Bounds on Atomic Object Implementations, Article 22, 2010. ,
Weighted voting for replicated data, Proceedings of the seventh symposium on Operating systems principles , SOSP '79, pp.150-172, 1979. ,
DOI : 10.1145/800215.806583
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
On Interprocess communication. Part I: Formalism. Part II: Algorithms. Distributed Computing, pp.87-103, 1986. ,
Distributed Algorithms, 1996. ,
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