Wait-free implementations in message-passing systems

Theoretical Computer Science

Volumn 220, Issue 1, 1999, Pages 211-245

  Chaudhuri, Soma ^a   Herlihy, Maurice ^b   Tuttle, Mark R ^c  

^a Iowa State University   (United States)

^b Brown Univerity   (United States)

^c HEWLETT PACKARD COMPANY   (United States)

Author keywords

Data structures; Distributed algorithms; Increment register; Message passing model; Strong renaming; Wait free algorithms

Indexed keywords

EID: 0141441470     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00242-4     Document Type: Article

References (21)

1. H. Attiya, A. Bar-Noy, D. Dolev, D. Koller, D. Peleg, R. Reischuk, Achievable cases in an asynchronous environment, in: Proc. 28th IEEE Symp. on Foundations of Computer Science, October 1987, pp. 337-346.
2. H. Attiya, A. Bar-Noy, D. Dolev, D. Peleg, R. Reischuk, Renaming in an asynchronous environment, J. ACM 37 (3) (1990) 524-548.
3. S. Chaudhuri, M. Herlihy, N. Lynch, M.R. Tuttle, A tight lower bound for k-set agreement, in: Proc. 34th IEEE Symp. on Foundations of Computer Science, 1993, pp. 206-215.
4. S. Chaudhuri, M.R. Tuttle, Fast increment registers, in: G. Tel, P. Vitányi (Eds.), Proc. 8th Internat. Workshop on Distributed Algorithms, Lecture Notes in Computer Science, vol. 857, Springer-Verlag, Berlin, 1994, pp. 74-88.
5. M.J. Fischer, N.A. Lynch, A lower bound for the time to assure interactive consistency, Inform. Process. Lett. 14 (4) (1982) 183-186.
6. M.J. Fischer, N.A. Lynch, M.S. Paterson, Impossibility of distributed consensus with one faulty processor, J. ACM 32 (2) (1985) 374-382.
7. G.N. Frederickson, N.A. Lynch, Electing a leader in a synchronous ring, J. ACM 34 (1) (1987) 98-115.
8. J.Y. Halpern, R. Fagin, Modelling knowledge and action in distributed systems, Distrib. Comput. 3 (4) (1989) 159-179.
9. J.Y. Halpern, Y. Moses, Knowledge and common knowledge in a distributed environment, J. ACM 37 (3) (1990) 549-587.
10. M.P. Herlihy, Wait-free synchronization, ACM Trans. Programming Languages Systems 13 (1) (1991) 124-149.
11. M. Herlihy, Randomized wait-free concurrent objects, in: Proc. 10th Annu. ACM Symp. on Principles of Distributed Computing, 1991, pp. 11-22.
12. M.P. Herlihy, N. Shavit, The asynchronous computability theorem for t-resilient tasks, in: Proc. 25th ACM Symp. on Theory of Computing, 1993, pp. 111-120.
13. M.P. Herlihy, M.R. Tuttle, Wait-free computation in message-passing systems: preliminary report, in: Proc. 9th Annu. ACM Symp. on Principles of Distributed Computing, 1990, pp. 347-362.
14. M.P. Herlihy, J.M. Wing, Linearizability: A correctness condition for concurrent objects, ACM Trans. Programming Languages Systems 12 (3) (1990) 463-492.
15. L. Lamport, Time, clocks, and the ordering of events in a distributed system, Comm. ACM 21 (7) (1978) 558-564.
16. L. Lamport, The part-time parliament, Technical Report 49, DEC Systems Research Center, September 1989.
17. L.Lamport, R. Shostak, M. Pease, The Byzantine generals problem, ACM Trans. Programming Languages and Systems 4 (3) (1982) 382-401.
18. Y. Moses, M.R. Tuttle, Programming simultaneous actions using common knowledge, Algorithmica 3 (1) (1988) 121-169.
19. M. Pease, R. Shostak, L. Lamport, Reaching agreement in the presence of faults, J. ACM 27 (2) (1980) 228-234.
20. F.B. Schneider, Implementing fault-tolerant services using the state machine approach: A tutorial, Technical report, Cornell University, Computer Science Department, November 1987.
21. E. Styer, G.L. Peterson, Tight bounds for shared memory symetric mutual exclusion problems, in: Proc. 8th Annu. ACM Symp. on Principles of Distributed Computing, August 1989, pp. 177-192.