Relationships between broadcast and shared memory in reliable anonymous distributed systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3274, Issue , 2004, Pages 260-274

  Aspnes, James ^a   Fich, Faith ^b   Ruppert, Eric ^c  

^a YALE UNIVERSITY   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

^c YORK UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 35048823069     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30186-8_19     Document Type: Article

References (16)

1. Dana Angluin. Local and global properties in networks of processors. In Proceedings of the 12th ACM Symposium on Theory of Computing, pages 82-93, 1980.
2. James Aspnes, Gauri Shah, and Jatin Shah. Wait-free consensus with infinite arrivals. In Proceedings of the 34th ACM Symposium on Theory of Computing, pages 524-533, 2002.
3. Hagit Attiya, Alia Gorbach, and Shlomo Moran. Computing in totally anonymous asynchronous shared memory systems. Information and Computation, 173(2):162183, March 2002.
4. Paolo Boldi and Sebastiano Vigna. Computing anonymously with arbitrary knowledge. In Proceedings of the 18th ACM Symposium on Principles of Distributed Computing, pages 173-179, 1999.
5. Paolo Boldi and Sebastiano Vigna. An effective characterization of computability in anonymous networks. In Distributed Computing, 15th International Conference, volume 2180 of LNCS, pages 33-47, 2001.
6. Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, and Paul Vitanyi. On the importance of having an identity or, is consensus really universal? In Distributed Computing, 14th International Conference, volume 1914 of LNCS, pages 134-148, 2000.
7. Catalin Drulacirc;. The totally anonymous shared memory model in which the number of processes is known. Personal communication.
8. Faith Fich and Eric Ruppert. Hundreds of impossibility results for distributed computing. Distributed Computing, 16(2-3):121-163, September 2003.
9. Edward Fredkin. Trie memory. Communications of the ACM, 3(9), August 1960.
10. Maurice P. Herlihy and Jeannette M. Wing. Linearizability: A correctness condition for concurrent objects. A CM Transactions on Programming Languages and Systems, 12(3):463-492, July 1990.
11. Prasad Jayanti. Robust wait-free hierarchies. Journal of the ACM, 44(4):592-614, July 1997.
12. Prasad Jayanti. Solvability of consensus: Composition breaks down for nondeterministic types. SIAM Journal on Computing, 28(3):782-797, September 1998.
13. Prasad Jayanti and Sam Toueg. Wakeup under read/write atomicity. In Distributed Algorithms, 4th International Workshop, volume 486 of LNCS, pages 277-288, 1990.
14. John H. Reif, editor. Synthesis of Parallel Algorithms. Morgan Kaufmann, 1993.
15. Naoshi Sakamoto. Comparison of initial conditions for distributed algorithms on anonymous networks. In Proceedings of the 18th ACM Symposium on Principles of Distributed Computing, pages 173-179, 1999.
16. Harold N. Shapiro. Introduction to the Theory of Numbers. John Wiley and Sons, 1983.