
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Takashi Harada, Masafumi Yamashita, "Improving the Availability of Mutual Exclusion Systems on Incomplete Networks," IEEE Transactions on Computers, vol. 48, no. 7, pp. 744747, July, 1999.  
BibTex  x  
@article{ 10.1109/12.780882, author = {Takashi Harada and Masafumi Yamashita}, title = {Improving the Availability of Mutual Exclusion Systems on Incomplete Networks}, journal ={IEEE Transactions on Computers}, volume = {48}, number = {7}, issn = {00189340}, year = {1999}, pages = {744747}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.780882}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Improving the Availability of Mutual Exclusion Systems on Incomplete Networks IS  7 SN  00189340 SP744 EP747 EPD  744747 A1  Takashi Harada, A1  Masafumi Yamashita, PY  1999 KW  Availability KW  coteries KW  distributed systems KW  $G$nondominatedness KW  graph theory KW  mutual exclusion problems KW  quorums. VL  48 JA  IEEE Transactions on Computers ER   
Abstract—We model a distributed system by a graph
[1] D. Agrawal and A.E. Abbadi, An Efficient and FaultTolerant Solution for Distributed Mutual Exclusion ACM Trans. Computing Systems, vol. 9, no. 1, pp. 120, 1991.
[2] M.O. Ball, “Computational Complexity of Network Reliability Analysis: An Overview,” IEEE Trans. Reliability, vol. 35, no. 3, pp. 230239, Aug. 1986.
[3] D. Barbara and H. GarciaMolina, "The Reliability of Voting Mechanisms," IEEE Trans. Computers, vol. 36, pp. 1,1971,208, Oct. 1987.
[4] J.C. Bioch and T. Ibaraki, “Generating and Approximating Nondominated Coteries,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 9, pp. 905914, Sept. 1995.
[5] H. GarciaMolina and D. Barbara, “How to Assign Votes in a Distributed System,” J. ACM, vol. 32, no. 4, pp. 841860, Oct. 1985.
[6] D.K. Gifford, “Weighted Voting for Replicated Data,” Proc. Seventh ACM SIGOPS Symp. Operating Systems Principles, pp. 150159, Dec. 1979.
[7] R. Holzman, Y. Marcus, and D. Peleg, “Load Balancing in Quorum Systems,” SIAM J. Discrete Mathematics, vol. 10, no. 2, pp. 223245, May 1997.
[8] T. Harada and M. Yamashita, “Nondominated Coteries on Graphs,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 6, pp. 667672, June 1997.
[9] T. Ibaraki and T. Kameda, "A Theory of Coteries: Mutual Exclusion in Distributed Systems," IEEE Trans. Parallel and Distributed Systems, vol. 4, pp. 779794, July 1993.
[10] T. Ibaraki, H. Nagamochi, and T. Kameda, "Optimal Coteries for Rings and Related Networks," Proc. 12th Int'l Conf. Distributed Computing Systems, pp. 650656, June 1992.
[11] T. Ibaraki, H. Nagamochi, and T. Kameda, “Optimal Coteries for Rings and Related Networks,” Distributed Computing, vol. 8, pp. 191201, 1995.
[12] M. Maekawa, “A$\sqrt N $Algorithm for Mutual Exclusion in Decentralized Systems,” ACM Trans. Computer Systems, vol. 3, no. 2, pp. 145159, May 1985.
[13] M.L. Nielsen and M. Mizuno,“Coterie join algorithm,” IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 5, pp. 582590, Sept. 1992.
[14] M. Naor and A. Wool, “The Load, Capacity and Availability of Quorum Systems,” Proc. 35th IEEE Symp. Foundations of Computer Science, pp. 214225, Nov. 1994.
[15] 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. 6473, Jan. 1994.
[16] R. Thomas, “A Majority Consensus Approach to Concurrency Control,” ACM Trans. Database Systems, vol. 7, no. 3, pp. 323342, June 1979.
[17] Z. Tong and R. Kain, "Vote Assignments in Weighted Voting Mechanisms," Proc. Seventh Symp. Reliable Distributed Systems, IEEE, Oct. 1988.