Computing in totally anonymous asynchronous shared memory systems

Information and Computation

Volumn 173, Issue 2, 2002, Pages 162-183

  Attiya, Hagit ^a   Gorbach, Alla ^a   Moran, Shlomo ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STORAGE EQUIPMENT; FUNCTIONS; SERVERS;

ASYNCHRONOUS SHARED MEMORY SYSTEMS;

DISTRIBUTED COMPUTER SYSTEMS;

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

References (20)

1. Angluin, D. (1980), Local and global properties in networks of processors, in "Proc. 12th ACM Symp. Theory of Comp.," pp. 82-93.
2. Attiya, H., Snir, M., and Warmuth, M. (1988), Computing on an anonymous ring, J. Assoc. Comput. Mach. 35, 845-876.
3. Brit, H., and Moran, S. (1996), Wait-freedom vs. bounded wait-freedom in public data structures, Univ. J. Comput. Sci. 2-19.
4. Burns, J. E., and Lynch, N. A. (1993), Bounds on shared memory for mutual exclusion, Inform. and Comput. 107, 171-184.
5. Dolev, D., Dwork, C., and Stockmeyer, L. (1987), On the minimal synchronism needed for distributed consensus, J. Assoc. Comput. Mach. 34, 77-97.
6. Drulǎ, C., The totally anonymous shared memory model in which the number of processes is known, personal communication.
7. Fich, F., Herlihy, M., and Shavit, N. (1998), On the space complexity of randomized synchronization, J. Assoc. Comput. Mach. 45, 843-862.
8. Fischer, M. J., Lynch, N. A., and Paterson, M. S. (1985), Impossibility of distributed consensus with one faulty processor, J. Assoc. Comput. Mach. 32, 374-382.
9. Fischer, M. J., Moran, S., Rudich, S., and Taubenfeld, G. (1996), The wakeup problem, SIAM J. Comput. 25, 1332-1357.
10. Herlihy, M. P. (1991), Wait-free synchronization, ACM Trans. Prog. Lang. System 13, 124-149.
11. Jayanti, P., Tan, K., and Toueg, S. (2000), Time and space lower bounds for nonblocking implementations, SIAM J. Comput. 30, 438-456.
12. Jayanti, P., and Toueg, S. (1990), Wakeup under read/write atomicity, in "Proc. 4th Int. Workshop on Dist. Algorithms," pp. 277-288.
13. Lamport, L., Shostak, R., and Pease, M. (1982), The Byzantine generals problem, ACM Trans. Prog. Lang. System. 4, 382-401.
14. Loui, M. C., and Abu-Amara, H. H. (1987), Memory requirements for agreement among unreliable asynchronous processes, in "Advances in Computing Research," Vol. 4, pp. 163-183, JAI Press, London.
15. Lubitch, R., and Moran, S. (1995), Closed schedulers: A novel technique for analyzing distributed protocols, Dist. Comp. 8, 203-210.
16. Moran, S., and Taubenfeld, G. (1997), A lower bound on wait-free counting, J. Algorithms 24, 1-19.
17. Moran, S., and Wolfsthal, Y. (1987), An extended impossibility result for asynchronous complete networks, Inform. Process. Lett. 26, 141-151.
18. Pease, M., Shostak, R., and Lamport, L. (1980), Reaching agreement in the presence of faults, J. Assoc. Comput. Mach. 27, 228-234.
19. Styer, E., and Peterson, G. L. (1989), Tight bounds for shared memory symmetric mutual exclusion problems, in "Proc. 8th ACM Symp. Principles of Dist. Comp.," pp. 177-192.
20. Taubenfeld, G., and Moran, S. (1996), Possibility and impossibility results in a shared memory environment, Acta Inform. 33, 1-20.