The Power of Multiobjects

Information and Computation

Volumn 153, Issue 1, 1999, Pages 117-138

  Afek, Yehuda ^a,b   Merritt, Michael ^b   Taubenfeld, Gadi ^b,c  

^a TEL AVIV UNIVERSITY   (Israel)

^b AT AND T LABS RESEARCH   (United States)

^c OPEN UNIVERSITY OF ISRAEL   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0141430473     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1999.2793     Document Type: Article

References (25)

1. Afek, Y., Attiya, H., Dolev, D. Gafni, E., Merritt, M., and Shavit, N. (1993), Atomic snapshots of shared memory, J. Assoc. Comput. Mach. 40(4), 873-890.
2. Attiya, H., and Dagan, E. (1996), Universal operations: Unary versus binary, in "Proc. of the 15th ACM Symp. on Principals of Distributed Computing," pp. 223-232.
3. Afek, Y., Greenberg, D., Merritt, M., and Taubenfeld, G. (1995), Computing with faulty shared memory, Journal of the ACM 42(6), 1231-1274. [Also in Proc. 11th Annual ACM Symp. on Principles of Distributed Computing, pages 47-58, August 1992].
4. Afek, Y., Greenberg, D., Merritt, M., and Taubenfeld, G. (1995), Computing with faulty shared memory, Journal of the ACM 42(6), 1231-1274. [Also in Proc. 11th Annual ACM Symp. on Principles of Distributed Computing, pages 47-58, August 1992].
5. Anderson, J. H., and Moir, M. (1995), Universal Constructions for Multi-Object Operations, in "Proc. of the 14th ACM Symp. on Principals of Distributed Computing," pp. 184-193.
6. Afek, Y. Meritt, M. Taubenfeld, G., and Touitou, D. (1997), Disentangling multi-object operations, in "Proc. 1997 ACM Symp. on Distributed Computing," pp. 111-120.
7. Anderson, J. (1993), Composite registers, Distrib. Comput. 6.
8. Anderson, J. (1994), Multi-writer composite registers, Distrib. Comput. 7.
9. Afek, Y., and Stupp, G. (1994), Delimiting the power of bounded size synchronization objects, in "Proc. 13th ACM Symp. on Principles of Distributed Computing," pp. 42-51.
10. Afek, Y. Weisberger, E., and Weisman, H. (1993), A completeness theorem for a class of synchronization objects, in "Proc. 12th ACM Symp. on Principles of Distributed Computing," pp. 159-170.
11. Fischer, M., Lynch, N., and Paterson, M. (1985), Impossibility of distributed consensus with one faulty process, Journal of the ACM 32, 374-382.
12. Herlihy, M. (1991), Wait-free synchronization, ACM Trans. Programm. Lang. Systems 13(1), 124-149.
13. Herlihy, M., and Moss, J. E. B. (1993), Transactional Memory: Architectural Support for Lock-Free Data Structures, in "20th Annual Symp. on Computer Architecture," pp. 289-300.
14. Herlihy, M., and Wing, J. M. (1990), Linearizability: A correctness condition for concurrent objects, ACM Trans. Programm. Lang. Systems 12(3), 463-492.
15. Israeli, A., and Rappoport, L. (1994), Disjoint-Access-Parallel Implementations of Strong Shared Memory, in "Proc. of the 12th ACM Symp. on Principles of Distributed Computing," pp. 151-160.
16. Jayanti, P. (1993), On the robustness of Herlihy's hierarchy, in "Proc. 12th Symp. on Principles of Distributed Computing," pp. 145-158.
17. Jayanti, P., and Khanna, S. (1997), On the power of multi-objects, in "Proc. 11th Int. Workshop on Distributed Algorithms, WDAG'97," LNCS 1320, pp. 320-332, Springer-Verlag, New York/Berlin.
18. Lamport, L. (1986), On interprocess communication, parts I and II, Distrib. Comput. 1, 77-101.
19. Lynch, N. A., and Tuttle, M. (1987), Hierarchical correctness proofs for distributed algorithms, in "Proc. of 6th ACM Symp. on Principles of Distributed Computation," pp. 137-151. [Expandend version available as Technical Report MIT/LCS/TR-387, April 1987]
20. Merritt, M., and Taubenfeld, G. (1994), Atomic m-register operations, Distrib. Computing 7, 213-221. [Also in "Proc. 5th Int. Workshop on Distributed Algorithms, 1991," pages 289-294]
21. Merritt, M., and Taubenfeld, G. (1994), Atomic m-register operations, Distrib. Computing 7, 213-221. [Also in "Proc. 5th Int. Workshop on Distributed Algorithms, 1991," pages 289-294]
22. Patil, S. S. (1971), Limitations of capabilities of Dijkstra's semaphore primitives for coordination among processes, in "Project MAC Computational Structures Group," MIT memo 57.
23. Ruppert, E. Consensus numbers of multi-objects, in "Proc. of the 17th Annual ACM Symp. on Principals of Distributed Computing, July 1998."
24. Shavit, N., and Touitou, D. Software transactional memory, in "Proc. of the 14th Annual ACM Symp. on Principals of Distributed Computing, August 1995," pp. 204-213.
25. Weisman, H. (1994), "Implementing Shared Memory Overwriting Objects," Master's thesis, Tel-Aviv University.