Time-adaptive algorithms for synchronization

SIAM Journal on Computing

Volumn 26, Issue 2, 1997, Pages 539-556

  Alur, Rajeev ^a   Attiya, Hagit ^b   Taubenfeld, Gadi ^a,c  

^a LUCENT TECHNOLOGIES   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c OPEN UNIVERSITY OF ISRAEL   (Israel)

Author keywords

Consensus; Distributed computing; Mutual exclusion; Timing based algorithms

Indexed keywords

EID: 0011587343     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794265244     Document Type: Article

References (19)

1. R. ALUR AND G. TAUBENFELD, Fast timing-based algorithms, Distrib. Comput., 10 (1996), pp. 1-10.
2. R. ALUR AND G. TAUBENFELD, How to share an object: A fast timing-based solution, in Proc. 5th IEEE Symposium on Parallel and Distributed Processing, IEEE Computer Society Press, Los Alamitos, CA, 1993, pp. 470-477. remove
3. R. ALUR AND G. TAUBENFELD, Contention-free complexity of shared memory algorithms, manuscript, 1994.
4. J. ASPNES AND M. HERLIHY, Fast randomized consensus using shared memory, J. Algorithms, 11 (1990), pp. 441-461.
5. H. ATTIYA, C. DWORK, N. LYNCH, AND L. STOCKMEYER, Bounds on the time to reach agreement in the presence of timing uncertainty, J. Assoc. Comput. Mach., 41 (1994), pp. 122-152.
6. M. CHOY AND A. SINGH, Adaptive solution to the mutual exclusion problem, in Proc. 12th ACM Symposium on Principles of Distributed Computing, ACM, New York, 1993, pp. 183-194.
7. D. DOLEV, C. DWORK, AND L. STOCKMEYER, On the minimal synchronism needed for distributed consensus, J. Assoc. Comput. Mach., 34 (1987), pp. 77-97.
8. E. W. DIJKSTRA, Solution of a problem in concurrent programming control, Comm. Assoc. Comput. Mach., 8 (1965), p. 569.
9. C. DWORK, N. LYNCH, AND L. STOCKMEYER, Consensus in the presence of partial synchrony, J. Assoc. Comput. Mach., 35 (1988), pp. 288-323.
10. M. FISCHER, N. LYNCH, AND M. PATERSON, Impossibility of distributed consensus with one faulty process, J. Assoc. Comput. Mach., 32 (1985), pp. 374-382.
11. M. HERLIHY, Wait-free synchronization, ACM Trans. Programming Lang. Systems, 11 (1991), pp. 124-149.
12. A. HERZBERG AND S. KUTTEN, Efficient detection of message forwarding faults, in Proc. 8th ACM Symposium on Principles of Distributed Computing, ACM, New York, 1989, pp. 339-353.
13. M. LOUI AND H. ABU-AMARA, Memory requirements for agreement among unreliable asynchronous processes, Adv. Comput. Res., 4 (1987), pp. 163-183.
14. L. LAMPORT, A fast mutual exclusion algorithm, ACM Trans. Comput. Systems, 5 (1987), pp. 1-11.
15. N. LYNCH AND N. SHAVIT, Timing-based mutual exclusion, in Proc. 13th IEEE Real-Time Systems Symposium, IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 2-11.
16. M. M. MICHAEL AND M. SCOTT, Fast mutual exclusion, even with contention, Technical Report 460, Department of Computer Science, University of Rochester, Rochester, NY, 1993.
17. M. PEASE, R. SHOSTAK, AND L. LAMPORT, Reaching agreement in the presence of faults, J. Assoc. Comput. Mach., 27 (1980), pp. 228-234.
18. E. STYER, Improved fast mutual exclusion, in Proc. 11th ACM Symposium on Principles of Distributed Computing, ACM, New York, 1992, pp. 159-168.
19. J-H. YANG AND J. H. ANDERSON, Fast, scalable synchronization with minimal hardware support, in Proc. 12th ACM Symposium on Principles of Distributed Computing, ACM, New York, 1993, pp. 171-182.