
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, "Coterie Join Operation and Tree Structured kCoteries," IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 9, pp. 865874, September, 2001.  
BibTex  x  
@article{ 10.1109/71.954617, author = {Takashi Harada and Masafumi Yamashita}, title = {Coterie Join Operation and Tree Structured kCoteries}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {12}, number = {9}, issn = {10459219}, year = {2001}, pages = {865874}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.954617}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Coterie Join Operation and Tree Structured kCoteries IS  9 SN  10459219 SP865 EP874 EPD  865874 A1  Takashi Harada, A1  Masafumi Yamashita, PY  2001 KW  Availability KW  distributed systems KW  kcoteries KW  ksemicoteries KW  kmutual exclusion problem KW  message complexity KW  nondominatedness KW  quorums. VL  12 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—The coterie join operation proposed by Neilsen and Mizuno produces, from a
[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] D. Agrawal, O. Egecioglu, and A. El Abbadi, Analysis of QuorumBased Protocols for Distributed (k+1) Exclusion IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 5, pp. 533537, May 1997.
[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] S.Y. Cheung, M.H. Ammar, and M. Ahamad, "The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data," IEEE Trans. Knowledge and Data Eng., vol. 4, no. 6, pp. 582592, 1992.
[6] H.K. Chang, S.M. Yuan, “Performance Characterization of the Tree Quorum Algorithm,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 6, pp. 658662, June 1995.
[7] K. Diks, E. Kranakis, D. Krizanc, B. Mans, and A. Pelc, "Optimal Coteries and Voting Schemes," Information Processing Letters, vol. 51, pp. 16, 1994.
[8] S. Fujita, M. Yamashita, and T. Ae, "Distributed kMutual Exclusion Problem and kCoteries," Proc. Symp. Algorithms, pp. 2231, 1991.
[9] D.K. Gifford, “Weighted Voting for Replicated Data,” Proc. Seventh ACM SIGOPS Symp. Operating Systems Principles, pp. 150159, Dec. 1979.
[10] H. GarciaMolina and D. Barbara, “How to Assign Votes in a Distributed System,” J. ACM, vol. 32, no. 4, pp. 841860, Oct. 1985.
[11] S.T. Huang, J.R. Jiang, and Y.C. Kuo, KCoteries for FaultTolerant k Entries to a Critical Section Proc. 13th Int'l Conf. Distributed Computing Systems, pp. 7481, May 1993.
[12] 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.
[13] J.R. Jiang and S.T. Huang, Obtaining Nondominated KCoteries for FaultTolerant Distributed KMutual Exclusion Proc. Int'l Conf. Parallel and Distributed Systems, 1994.
[14] H. Kakugawa, S. Fujita, M. Yamashita, and T. Ae, “A DistributedkMutual Exclusion Algorithm UsingkCoterie,” Information Processing Letters, vol. 49, no. 4, pp. 213218, Feb. 1994.
[15] A. Kumar, “Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data,” IEEE Trans. Computers, vol. 40, no. 9, pp. 9961,004, Sept. 1991.
[16] Y.C. Kuo and S.T. Huang, A Geometric Approach for Constructing Coteries andkCoteries IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 4, pp. 402411, Apr. 1997.
[17] M. Maekawa, “A$\sqrt N $Algorithm for Mutual Exclusion in Decentralized Systems,” ACM Trans. Computer Systems, vol. 3, no. 2, pp. 145159, May 1985.
[18] M.L. Nielsen and M. Mizuno,“Coterie join algorithm,” IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 5, pp. 582590, Sept. 1992.
[19] M.L. Neilsen and M. Mizuno, “NondominatedkCoteries for Multiple Mutual Exclusion,” Information Processing Letters, vol. 50, no. 5, pp. 247252, June 1994.
[20] M.L. Neilsen and M. Mizuno, “Erratum to NondominatedkCoteries for Multiple Mutual Exclusion,” Information Processing Letters, vol. 60, no. 6, pp. 31923, Dec. 1996.
[21] K. Raymond, "A Distributed Algorithm for Multiple Entries to a Critical Section," Information Processing Letters, vol. 30, no. 4, pp. 189193, Feb. 1989.
[22] P.K. Srimani and R.L.N. Reddy, "Another Distributed Algorithm for Multiple Entries to a Critical Section," Information Processing Letters, vol. 41, no. 1, pp. 5157, Jan. 1992.
[23] S.M. Yuan and H.K. Chang, “Message Complexity of the Tree Quorum Algorithm,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 8, pp. 887890, Aug. 1995.