Relationships between broadcast and shared memory in reliable anonymous distributed systems

Distributed Computing

Volumn 18, Issue 3, 2006, Pages 209-219

  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

Anonymous; Broadcast; Robustness; Shared memory; Simulations

Indexed keywords

BROADCASTING; COMMUNICATION SYSTEMS; COMPUTER SIMULATION; ROBUSTNESS (CONTROL SYSTEMS);

ANONYMOUS; BOUNDED COUNTERS; READ-WRITE REGISTERS; SHARED MEMORY;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 32844462541     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-005-0145-4     Document Type: Article

References (25)

1. Angluin, D.: Local and global properties in networks of processors. In: Proceedings of the 12th ACM Symposium on Theory of Computing, pp. 82-93 (1980)
2. Aspnes, J., Fich, F., Ruppert, E.: Relationships between broadcast and shared memory in reliable anonymous distributed systems. In: Proc. 18th International Symposium on Distributed Computing, LNCS, vol. 3274, pp. 260-274 (2004)
3. Aspnes, J., Shah, G., Shah, J.: Wait-free consensus with infinite arrivals. In: Proceedings of the 34th ACM Symposium on Theory of Computing, pp. 524-533 (2002)
4. Attiya, H., Gorbach, A., Moran, S.: Computing in totally anonymous asynchronous shared memory systems. Information and Computation 173(2), 162-183 (2002)
5. Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics, 2nd ed. Wiley-Interscience (2004)
6. Boldi, P., Vigna, S.: Computing anonymously with arbitrary knowledge. In: Proceedings of the 18th ACM Symposium on Principles of Distributed Computing, pp. 173-179 (1999)
7. Boldi, P., Vigna, S.: An effective characterization of computability in anonymous networks. In: Distributed Computing, 15th International Conference, LNCS, vol. 2180, pp. 33-47 (2001)
8. Buhrman, H., Panconesi, A., Silvestri, R., Vitanyi, P.: On the importance of having an identity or, is consensus really universal? In: Distributed Computing, 14th International Conference, LNCS, vol. 1914, pp. 134-148 (2000)
9. Chandra, T.D.: Polylog randomized wait-free consensus. In: Proceedings of the 15th ACM Symposium on Principles of Distributed Computing, pp. 166-175 (1996)
10. Drulǎ, C.: The totally anonymous shared memory model in which the number of processes is known. Personal communication.
11. Eǧecioǧlu, O., Singh, A.K.: Naming symmetric processes using shared variables. Distributed Computing 8(1), 19-38 (1994)
12. Fich, F., Ruppert, E.: Hundreds of impossibility results for distributed computing. Distributed Computing 16(2-3), 121-163 (2003)
13. Fredkin, E.: Trie memory. Commun. ACM 3(9) (1960)
14. Guerraoui, R., Ruppert, E.: What can be implemented anonymously? In: Proc. 19th International Symposium on Distributed Computing, LNCS, vol. 3724, pp. 244-259 (2005)
15. Herlihy, M.P., Wing, J.M.: Linearizability: A correctness condition for concurrent objects. ACM Trans. Progr. Lang. Syst. 12(3), 463-492 (1990)
16. Jayanti, P.: Robust wait-free hierarchies. J. ACM 44(4), 592-614 (1997)
17. Jayanti, P.: Solvability of consensus: Composition breaks down for nondeterministic types. SIAM J. Comput. 28(3), 782-797 (1998)
18. Jayanti, P., Toueg, S.: Wakeup under read/write atomicity. In: Distributed Algorithms, 4th International Workshop, LNCS, vol. 486, pp. 277-288 (1990)
19. Kutten, S., Ostrovsky, R., Patt-Shamir, B.: The Las-Vegas processor identity problem (How and when to be unique). Journal of Algorithms 37(2), 468-494 (2000)
20. Lipton, R.J., Park, A.: The processor identity problem. Inf. Process. Lett. 36(2), 91-94 (1990)
21. Panconesi, A., Papatriantafilou, M., Tsigas, P., Vitányi, P.: Randomized naming using wait-free shared variables. Distributed Computing 11(3), 113-124 (1998)
22. Reif, J.H. (ed.): Synthesis of Parallel Algorithms. Morgan Kaufmann (1993)
23. Sakamoto, N.: Comparison of initial conditions for distributed algorithms on anonymous networks. In: Proceedings of the 18th ACM Symposium on Principles of Distributed Computing, pp. 173-179 (1999)
24. Shapiro, H.N.: Introduction to the Theory of Numbers. John Wiley and Sons (1983)
25. Teng, S.H.: Space efficient processor identity protocol. Inf. Process. Lett. 34(3), 147-154 (1990)