Efficient and Robust Sharing of Memory in Message-Passing Systems

Journal of Algorithms

Volumn 34, Issue 1, 2000, Pages 109-127

  Attiya, Hagit ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Atomic registers; Fault tolerance; Message passing; Processor failures; Shared memory; Simulation; Wait free algorithms

Indexed keywords

EID: 0003578042     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1999.1025     Document Type: Article

References (19)

1. D. Agrawal, O. Egecioglu, and A. El Abbadi, Analysis of quorum-based protocols for distributed (k + 1)-exclusion, in "Proceedings of the 1st Annual International Conference on Computing and Combinatorics, Lecture Notes in Computer Science," Vol. 959, pp. 161-170, Springer-Verlag, New York/Berlin, 1995.
2. H. Attiya, A. Bar-Noy, and D. Dolev, Sharing memory robustly in message-passing systems, J. Assoc. Comput. Mach. 42, No. 1 (1995), 121-132.
3. H. Attiya, A. Bar-Noy, D. Dolev, D. Peleg, and R. Reischuk, Renaming in an asynchronous environment, J. Assoc. Comput. Mach. 37, No. 3, (1990), 524-547.
4. H. Attiya and S. Rajsbaum, The combinatorial structure of wait-free solvable tasks, in "Proceedings of the 10th International Workshop on Distributed Algorithms, Lecture Notes in Computer Science," Vol. 1151, pp. 321-343, Springer-Verlag, New York/Berlin, 1996. [Technical Report CS0924, Department of Computer Science, Technion, December 1997]
5. B. Awerbuch, Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems, in "Proceedings of the 19th ACM Symposium on Theory of Computing," pp. 230-240, 1987.
6. A. Bar-Noy and D. Dolev, A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment, Math. Systems Theory, 26, No. 1 (1993), 21-39.
7. E. Borowsky and E. Gafni, Generalized FLP impossibility result for t-resilient asynchronous computations, in "Proceedings of the 25th ACM Symposium on Theory of Computing," pp. 91-100, 1993.
8. E. Borowsky, E. Gafni, N. Lynch, and S. Rajsbaum, "The BG Distributed Simulation Algorithm," Technical report MIT/LCS/TM-573, Laboratory for Computer Science, MIT, Dec. 1997.
9. B. Chor and L. Moscovici, Solvability in asynchronous environments, in "Proceedings of the 30th IEEE Symposium on Foundations of Computer Science," pp. 422-427, 1989.
10. C. Dwork and O. Waarts, Simple and efficient bounded concurrent timestamping or bounded concurrent timestamp systems are comprehensible! in "Proceedings of the 24th ACM Symposium on Theory of Computing," pp. 655-666, 1992.
11. D. K. Gifford, Weighted voting for replicated data, in "Proceedings of the 7th Annual ACM Symposium on Operating System Principles," 1989.
12. S. Haldar and K. Vidyasankar, Constructing 1-writer multireader multivalued atomic variable from regular variables, J. Assoc. Comp. Mach. 42, No. 1 (1995), 186-203.
13. M. Herlihy and N. Shavit, The asynchronous computability theorem for t-resilient tasks, in "Proceedings of the 25th ACM Symposium on Theory of Computing," pp. 111-120, 1993.
14. M. Herlihy and N. Shavit, A simple constructive computability theorem for wait-free computation, in "Proceedings of the 26th ACM Symposium on Theory of Computing," pp. 243-252, 1994.
15. M. P. Herlihy and J. M. Wing, Linearizability: A correctness condition for concurrent objects, ACM Trans. Prog. Lang. Syst., 12, No. 3 (1990), 463-492.
16. A. Israeli and M. Li, Bounded time-stamps, Dist. Comput. 6, No. 4 (1993), 205-209.
17. L. Lamport, On interprocess communication, Part I: Basic formalism, Distrib. Comput. 1, No. 2 (1986), 77-85.
18. D. Peleg and A. Wool, The availability of quorum systems, Inform. and Comput. 123, No. 2 (1995), 210-223.
19. S. Rangarajan, S. Setia, and S. K. Tripathi, Fault-tolerant algorithm for replicated data management, IEEE Trans. Parallel Distrib. Systems 6, No. 12 (1995), 1271-1282.