The Instancy of Snapshots and Commuting Objects

Journal of Algorithms

Volumn 30, Issue 1, 1999, Pages 68-105

  Afek, Yehuda ^a   Weisberger, Eytan ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

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

References (31)

1. Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt, and N. Shavit, Atomic snapshots of shared memory, J. Assoc. Comput. Mach. 40(4) (1993), 873-890.
2. H. Attiya, D. Dolev, and N. Shavit, Bounded polynomial randomized consensus, in "Proceedings of the 8th Assoc. Comput. Mach. Symposium on Principles of Distributed Computing, Edmonton, Alberta, Canada, August 1989," pp. 281-293.
3. Y. Afek, D. Greenberg, M. Merritt, and G. Taubenfeld, Computing with faulty shared memory, in "Proceedings of the 11th Annual Assoc. Comput. Mach. Symposium on Principles of Distributed Computing, August 1992," pp. 47-58.
4. Y. Afek, E. Gafni, J. Tromp, and P. M. B. Vitányi, Wait-free test-and-set, in "Proceedings of the 6th International Workshop on Distributed Algorithms: Lecture Notes in Computer Science, November 1992," pp. 85-94.
5. J. Aspnes and M. Herlihy, Fast randomized consensus using shared memory, J. Algorithms (1990), 281-294.
6. J. Aspnes, M. Herlihy, and N. Shavit, Counting networks, J. Assoc. Comput. Mach 41(5) (1994), 1020-1048.
7. J. H. Anderson, Composite registers, in "Proceedings of the Ninth Annual Assoc. Comput. Mach. Symposium on Principles of Distributed Computing, August 1990," pp. 15-29.
8. J. H. Anderson, Composite registers, Distributed Computing 6 (1993).
9. H. Attiya and O. Rachman, Atomic snapshot in o(n log n) operations, in "Proceedings of the 12th Assoc. Comput. Mach. Symposium on Principles of Distributed Computing, August 1993," pp. 29-40.
10. J. Aspnes, Time and space efficient randomized consensus, in "Proceedings of the Ninth Assoc. Comput. Mach. Symposium on Principles of Distributed Computing, August 1990," pp. 325-331.
11. Y. Afek, E. Weisberger, and H. Weisman, A completeness theorem for a class of synchronization objects, in "Proceedings of the 12th Assoc. Comput. Mach. Symposium on Principles of Distributed Computing, August 1993," pp. 159-170.
12. B. N. Bershad, "Practical Considerations for Lock-free Concurrent Objects," Technical Report CMU-CS-91-183, Carnegie Mellon University, September 1991.
13. E. Borowsky and E. Gafni, Generalized flp impossibility result for t-resilient asynchronous computations, in "Proceedings of the 25th Assoc. Comput. Mach. Symposium on Theory of Computing, May 1993."
14. E. Borowsky and E. Gafni, Immediate atomic snapshots and fast renaming, in "Proceedings of the 12th Assoc. Comput. Mach. Symposium on Principles of Distributed Computing, August 1993," pp. 41-51.
15. D. Dolev and N. Shavit, Bounded concurrent time-stamp systems are constructible, in "Proceedings of the 21st Annual Assoc. Comput. Mach. Symposium on Theory of Computing, 1989."
16. A. Gottlieb, B. D. Lubachevsky, and L. Rudolph, Basic techniques for the efficient coordination of very large numbers of cooperating sequential proc, ACM Trans. Program. Languages Syst. 5(2) (1983), 164-189.
17. M. Herlihy, Wait-free synchronization, ACM Trans. Program. Languages Syst. 13(1) (1991), 124-149.
18. M. P. Herlihy, Randomized wait-free concurrent objects, in "Proceedings of the Tenth ACM Symposium on Principles of Distributed Computing, 1991," pp. 11-22.
19. M. Herlihy, N. Shavit, and O. Waarts, Linearizable counting networks, in "Proceedings of the 32nd IEEE Annual Symposium on Foundation of Computer Science, October 1991," pp. 526-535.
20. M. Herlihy and J. M. Wing, Axioms for concurrent objects, in "Proceedings of the 14th ACM Symposium on Principles of Programming languages, January 1987," pp. 13-26.
21. P. Jayanti, On the robustness of Herlihy's hierarchy, in "Proceedings of the 12th ACM Symposium on Principles of Distributed Computing, August 1993," pp. 145-158.
22. P. Jayanti, T. Chandra, and S. Toueg, Fault-tolerant wait-free shared objects, in "Proceedings of the 33rd IEEE Annual Symposium on Foundation of Computer Science, October 1992," IEEE Comput. Soc., Los Alamitos, CA.
23. L. Lamport, Concurrent reading and writing, Comm. ACM 20(11) (1977), 806-811.
24. L. Lamport, Time, clocks, and the ordering of events in a distributed system, Comm. ACM 21(7) (1978), 558-565.
25. L. Lamport, On interprocess communication, parts I and II, Distributed Comput. 1 (1986), 77-101.
26. G. H. Mealy, A method for synthesizing sequential circuits, Technical Report 34, Bell Systems Technologies, September 1955.
27. S. A. Plotkin, "Chapter 4: Sticky Bits and Universality of Consensus," Ph.D. thesis, MIT, 1988.
28. J. L. Peterson and Abraham Silberschatz, "Operating System Concepts," Addison-Wesley, Reading, MA, 1985.
29. M. Saks, N. Shavit, and H. Woll, Optimal time randomized consensus - making resilient algorithms fast in practice, in "Proceedings of the 2nd Annual Assoc. Comput. Mach.-SIAM Symposium on Discrete Algorithms, January 1991," pp. 351-362.
30. M. Saks and F. Zaharoglou, Wait-free k-set agreement is impossible: The topology of public knowledge, in "Proceedings of the 25th ACM Symposium on Theory of Computing, May 1993."
31. H. Weisman, "Implementing Shared Memory Overwriting Objects," Master's thesis, Tel Aviv University, 1994.