Regular ArticleThe Instancy of Snapshots and Commuting Objects☆
References (32)
- et al.
Atomic snapshots of shared memory
J. Assoc. Comput. Mach.
(1993) - H. Attiya, D. Dolev, N. Shavit, Bounded polynomial randomized consensus, in, Proceedings of the 8th Assoc. Comput....
- Y. Afek, D. Greenberg, M. Merritt, G. Taubenfeld, Computing with faulty shared memory, in, Proceedings of the 11th...
- Y. Afek, E. Gafni, J. Tromp, P. M. B. Vitányi, Wait-free test-and-set, in, Proceedings of the 6th International...
- et al.
Fast randomized consensus using shared memory
J. Algorithms
(1990) - et al.
Counting networks
J. Assoc. Comput. Mach
(1994) - J. H. Anderson, Composite registers, in, Proceedings of the Ninth Annual Assoc. Comput. Mach. Symposium on Principles...
Composite registers
Distributed Computing
(1993)- H. Attiya, O. Rachman, Atomic snapshot inonn, in, Proceedings of the 12th Assoc. Comput. Mach. Symposium on Principles...
- J. Aspnes, Time and space efficient randomized consensus, in, Proceedings of the Ninth Assoc. Comput. Mach. Symposium...
Cited by (0)
- ☆
A preliminary version of this paper was presented at the 12th Assoc. Comput. Mach. Symposium on Principles of Distributed Computing, 1993.
- †
Motorola Semi-Conductors Israel.
Copyright © 1999 Academic Press. All rights reserved.