Minimizing the maximum delay for reaching consensus in quorum-based mutual exclusion schemes

IEEE Transactions on Parallel and Distributed Systems

Volumn 10, Issue 4, 1999, Pages 337-345

  Tsuchiya, Tatsuhiro ^a,b   Yamaguchi, Masatoshi ^c   Kikuno, Tohru ^a,b  

^a IEEE   (Japan)

^b OSAKA UNIVERSITY   (Japan)

^c Sumitomo Corporation   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION DELAY; MUTUAL EXCLUSION; QUORUM;

ALGORITHMS; POLYNOMIALS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0032625150     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.762814     Document Type: Article

References (15)

1. J.C. Bioch and T. Ibaraki, "Generating and Approximating Nondominated Coteries," IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 9, pp. 905-914, Sept. 1995.
2. G. Cao, M. Singhal, Y. Deng, N. Rishe, and W. Sun, "A Delay-Optimal Quorum-Based Mutual Exclusion Scheme with Fault-Tolerance Capability," Proc. 18th Int'l Conf. Distributed Computing Systems, pp. 444-451, 1998.
3. Y.G. Chen and M.C. Yuang, "A Cut-Based Method for Terminal-Pair Reliability," IEEE Trans. Reliability, vol. 45, no. 3, pp. 413-416, 1996.
4. H. Garcia-Molina and D. Barbara, "How to Assign Votes in a Distributed System," J. ACM, vol. 32, no. 4, pp. 841-860, Oct. 1985.
5. A.W. Fu, "Delay-Optimal Quorum Consensus for Distributed Systems," IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 1, pp. 59-69, Jan. 1997.
6. R.W. Floyd, "Algorithm 97: Shortest Path," Comm. ACM, vol. 5, p. 345, 1962.
7. T. Harada and M. Yamashita, "Nondominated Coteries on Graphs," IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 6, pp. 667-672, June 1997.
8. T. Ibaraki, H. Nagamochi, and T. Kameda, "Optimal Coteries for Rings and Related Networks," Distributed Computing, vol. 8, pp. 191-201, 1995.
9. M. Maekawa, "A √N Algorithm for Mutual Exclusion in Decentralized Systems," ACM Trans. Computer Systems, vol. 3, no. 2, pp. 145-159, May 1985.
10. 2 log n)," SIAM J. Computing, vol. 16, no. 6, pp. 1,023-1,031, Dec. 1987.
11. M. Naor and A. Wool, "The Load, Capacity, and Availability of Quorum Systems," SIAM J. Computing, vol. 27, no. 2, pp. 423-447, Apr. 1998.
12. D. Saha, S. Rangarajan, and S.K. Tripathi, "An Analysis of the Average Message Overhead in Replica Control Protocols," IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 10, pp. 1,026-1,034, Oct. 1996.
13. B. Sanders, "The Information Structure of Distributed Mutual Exclusion Algorithm," ACM Trans. Computer Systems, vol. 5, no. 3, pp. 284-299, Aug. 1987.
14. M. Spasojevic and P. Berman, "Voting as the Optimal Static Pessimistic Scheme for Managing Replicated Data," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 1, pp. 64-73, Jan. 1994.
15. J. Tang and N. Natarajan, "Obtaining Coteries That Optimize the Availability of Replicated Databases," IEEE Trans. Knowledge and Data Eng., vol. 5, no. 2, pp. 309-321, Apr. 1993.