Availability evaluation of quorum-based mutual exclusion schemes in general topology networks

Computer Journal

Volumn 42, Issue 7, 1999, Pages 613-622

  Tsuchiya, Tatsuhiro ^a   Kikuno, Tohru ^a  

^a OSAKA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; FAILURE ANALYSIS; RESPONSE TIME (COMPUTER SYSTEMS); TELECOMMUNICATION LINKS; TREES (MATHEMATICS);

MINIMAL QUORUM SPANNING TREES; QUORUM-BASED MUTUAL EXCLUSION METHODS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0033279929     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/42.7.613     Document Type: Article

References (27)

1. Singhal, M. (1993) A taxonomy of distributed mutual exclusion. J. Parallel Distributed Computing, 15, 94-101.
2. Agrawal, D. and El Abbadi, A. (1991) An efficient and fault-tolerant solution for distributed mutual exclusion. ACM Trans. Comput. Syst., 9, 1-20.
3. Garcia-Molina, H. and Barbara, D. (1985) How to assign votes in a distributed system. J. ACM, 32, 841-860.
4. Gifford, D. K. (1979) Weighted voting for replicated data. In Proc. 7th Symp. Operating System Principles, pp. 150-159. ACM Press, New York.
5. Rangarajan, S., Setia, S. and Tripathi, S. K. (1995) A fault-tolerant algorithm for replicated data management. IEEE Trans. Parallel Distrib. Syst., 6, 1271-1282.
6. Mullender, S. J. and Vitanyi, P. M. B. (1988) Distributed match-making. Algorithmica, 3, 367-391.
7. Lynch, N. A. and Shavartsman, A. A. (1997) Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts. In Proc. 27th In. Symp. on Fault-Tolerant Computing (FTCS-27), pp. 272-281. IEEE Computer Society Press, Los Alamitos, CA.
8. Maekawa, M. (1985) A √N algorithm for mutual exclusion in decentralized systems. ACM Trans. Comput. Syst., 3, 145-159.
9. Thomas, R. H. (1979) A majority consensus approach to concurrency control. ACM Trans. Database Syst., 4, 180-209.
10. Kumar, A. and Segev, A. (1993) Cost and availability tradeoffs in replicated data concurrency control. ACM Trans. Database Syst., 18, 102-131.
11. Menascé, D. A., Yesha, Y. and Kalpakis, K. (1994) On a unified framework for the evaluation of distributed quorum attainment protocols. IEEE Trans. Software Engng, 20, 868-884.
12. Saha, D., Rangarajan, S. and Tripathi, S. K. (1996) An analysis of the average message overhead in replica control protocols. IEEE Trans. Parallel Distrib. Syst., 7, 1026-1034.
13. Amir, Y. and Wool, A. (1996) Evaluating quorum systems over the Internet. In Proc. 26th Int. Symp. on Fault-Tolerant Computing (FTCS-26), pp. 26-35. IEEE Computer Society Press, Los Alamitos, CA.
14. Barbara, D. and Garcia-Molina, H. (1987) The reliability of voting mechanisms. IEEE Trans. Comput., 36, 1197-1207.
15. Tong, Z. and Kain, R. Y. (1991) Vote assignments in weighted voting mechanisms. IEEE Trans. Comput., 40, 664-667.
16. Harada, T. and Yamashita, M. (1997) Nondominated coteries on graphs. IEEE Trans. Parallel Distrib. Syst., 8, 667-672.
17. Ibaraki, T., Nagamochi, H. and Kameda, T. (1995) Optimal coteries for rings and related networks. Distrib. Comput., 8, 191-201.
18. Cao, G., Singhal, M., Deng, Y., Rishe, N. and Sun, W. (1998) A delay-optimal quorum-based mutual exclusion scheme with fault-tolerance capability. In Proc. 18th Int. Conf. on Distributed Computing Systems (ICDCS'98), pp. 444-451. IEEE Computer Society Press, Los Alamitos, CA.
19. Tang, J. and Natarajan, N. (1993) Obtaining coteries that optimize the availability of replicated databases. IEEE Trans. Knowledge Data Engng, 5, 309-321.
20. Hariri, S. and Raghavendra, C. S. (1987) SYREL: a symbolic reliability algorithm based on path and cutset methods. IEEE Trans. Comput., 36, 1224-1232.
21. Soh, S. and Rai, S. (1991) CAREL: computer aided reliability evaluator for distributed computing networks. IEEE Trans. Parallel Distrib. Syst., 2, 199-213.
22. Chen, Y. G. and Yuang, M. C. (1996) A cut-based method for terminal-pair reliability. IEEE Trans. Reliability, 45, 413-416.
23. Hariri, S. and Mutlu, H. (1995) Hierarchical modeling of availability in distributed systems. IEEE Trans. Software Engng, 21, 50-56.
24. Ibaraki, T. and Kameda, T. (1993) A theory of coteries: mutual exclusion in distributed systems. IEEE Trans. Parallel Distrib. Syst., 4, 779-794.
25. Kakugawa, H., Fujita, S., Yamashita, M. and Ae, T. (1993) Availability of k-coterie. IEEE Trans. Comput., 42, 553-558.
26. Choi, E. H., Tsuchiya, T. and Kikuno, T. (1999) On the availability of k-coteries in networks with unreliable nodes and links. In Proc. 4th Int. Workshop on Object-Oriented Real-Time Dependable Systems, pp. 148-155. IEEE Computer Society Press, Los Alamitos, CA.
27. Papadimitriou, C. H. and Sideri, M. (1991) Optimal coteries. In Proc. 14th Symp. Principles of Distributed Computing, pp. 75-80. ACM Press, New York.