Fault tolerance for token-based synchronization protocols

Proceedings - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001

Volumn , Issue , 2001, Pages 1257-1264

  Mueller, F ^a,b  

^a HUMBOLDT UNIVERSITY   (Germany)

^b LAWRENCE LIVERMORE NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FAULT DETECTION; FAULT TOLERANCE;

DECENTRALIZED APPROACH; DISTRIBUTED SYSTEMS; EXECUTION ENVIRONMENTS; FAULT INJECTION; MUTUAL EXCLUSIONS; SYNCHRONIZATION PROTOCOLS; TOLERATE FAULTS; TRADITIONAL APPROACHES;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 84981287179     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2001.925101     Document Type: Conference Paper

References (25)

1. D. Agrawal and A. El Abbadi. An efficient and fault-tolerant solution for distributed mutual exclusion. ACM Transactions on Computer Systems, 9(1):1-20, Feb. 1991.
2. A. Bouabdallah and J.-C. Konig. An improvement of Maekawa's mutual exclusion algorithm to make it fault-tolerant. Parallel Processing Letters, 2(2-3):283-290, Sept. 1992.
3. Y. Chang. Design of mutual exclusion algorithms for real-time distributed systems. J. Information Science and Engineering, 10(4):527-548, Dec. 1994.
4. Y. Chang. A simulation study on distributed mutual exclusion. J. Parallel Distrib. Comput., 33(2):107-121, Mar. 1996.
5. Y. Chang, M. Singhal, and M. Liu. An improved O(log(n)) mutual exclusion algorithm for distributed processing. In Int. Conference on Parallel Processing, volume 3, pages 295-302, 1990.
6. D. Culler, R. Karp, D. Patterson, A. Sahay, E. Santos, K. Schauser, R. Subramonian, and T. von Eicken. LogP: A practical model of parallel computation. Communications of the ACM, 39(11):78-85, Nov. 1996.
7. S. Fu, N. Tzeng, and Z. Li. Empirical evaluation of distributed mutual exclusion algorithms. In International Parallel Processing Symposium, pages 255-259, 1997.
8. A. Goscinski. Two algorithms for mutual exclusion in real-time distributed computer systems. J. Parallel Distrib. Comput., 9(1):77-82, May 1990.
9. T. Johnson. A performance comparison of fast distributed mutual exclusion algorithms. In Proc. 1995 Int. Conf. on Parallel Processing, pages 258-264, 1995.
10. L. Lamport. Time, clocks and ordering of events in distributed systems. Comm. ACM, 21(7):558-565, June 1978.
11. M. Maekawa. A sqrt(n) algorithm for mutual exclusion in decentralized systems. ACM Trans. on Computer Systems, 3(2):145-159, 1985.
12. D. Manivannan and M. Singhal. A decentralized token generation scheme for token-based mutual exclusion algorithms. International Journal of Computer Systems Science and Engineering, 11(1):45-54, Jan. 1996.
13. S. Mishra and P. K. Srimani. Fault-tolerant mutual exclusion algorithms. The Journal of Systems and Software, 11(2):111-130, Feb. 1990.
14. F. Mueller. Distributed shared-memory threads: DSM-threads. In Workshop on Run-Time Systems for Parallel Programming, pages 31-40, Apr. 1997.
15. F. Mueller. On the design and implementation of DSM-threads. In Proc. 1997 International Conference on Parallel and Distributed Processing Techniques and Applications, pages 315-324, June 1997. (invited).
16. F. Mueller. Prioritized token-based mutual exclusion for distributed systems. In International Parallel Processing Symposium, pages 791-795, 1998.
17. F. Mueller. Priority inheritance and ceilings for distributed mutual exclusion. In IEEE Real-Time Systems Symposium, pages 340-349, Dec. 1999.
18. F. Mueller. Decentralized synchronization for multithreaded dsms. In Workshop on Software Distributed Shared Memory, May 2000.
19. M. Naimi and M. Trehel. How to detect a failure and regenerate the token in the log(n) distributed algorithm for mutual exclusion. In J. van Leeuwen, editor, Distributed Algorithms, 2nd International Workshop, volume 312 of Lecture Notes in Computer Science, pages 155-166, Amsterdam, The Netherlands, 8-10 July 1987. Springer, 1988.
20. M. Naimi and M. Trehel. An improvement of the log(n) distributed algorithm for mutual exclusion. In Int. Conference on Distributed Computing Systems, 1987.
21. M. Naimi, M. Trehel, and A. Arnold. A log(N) distributed mutual exclusion algorithm based on path reversal. J. Parallel Distrib. Comput., 34(1):1-13, Apr. 1996.
22. K. Raymond. A tree-based algorithm for distributed mutual exclusion. ACM Trans. Comput. Systems, 7(1):61-77, Feb. 1989.
23. L. S. Sabel and K. Marzullo. Election vs. consensus in asynchronous systems. Technical Report TR95-1488, Cornell University, Computer Science Department, Feb. 1995.
24. M. Singhal. A heuristically-aided algorithm for mutual exclusion in distributed systems. IEEE Trans. Computers, 38(5):651-662, May 1989.
25. I. Suzuki and T. Kasami. A distributed mutual exclusion algorithm. ACM Trans. Comput. Systems, 18(12):94-101, Dec. 1993.