research-article

Availability of k-Coterie

Authors:

T. AeAuthors Info & Claims

IEEE Transactions on Computers, Volume 42, Issue 5

Pages 553 - 558

https://doi.org/10.1109/12.223674

Published: 01 May 1993 Publication History

Abstract

The distributed k-mutual-exclusion problem (k-mutex problem) is the problem of guaranteeing that at most k processes at a time can enter a critical section at a time in a distribution system. A method proposed for the solution of the distributed mutual exclusion problem (i.e., 1-mutex problem) by D. Barbara and H. Garcia-Molina (1987) is an extension of majority consensus and uses coteries. The goodness of coterie-based 1-mutex algorithm strongly depends on the availability of coterie, and it has been shown that majority coterie is optimal in this sense, provided that: the network topology is a complete graph, the links never fail, and p, the reliability of the process, is at least 1/2. The concept of a k-coterie, an extension of a coterie, is introduced for solving the k-mutex problem, and lower and upper bounds are derived on the reliability p for k-majority coterie, a natural extension of majority coterie, to be optimal, under conditions (1)-(3). For example, when k=3, p must be greater than 0.994 for k-majority coterie to be optimal.

References

[1]

{1} L. Lamport, "Time, clocks, and the ordering of events in a distributed system," Commun. ACM, vol. 21, pp. 558-565, July 1978.

Digital Library

[2]

{2} G. Ricart and A. K. Agrawala, "An optimal algorithm for mutual exclusion in computer network," Commun. ACM, vol. 24, pp. 9-17, Jan. 1981.

Digital Library

[3]

{3} G. Ricart and A. K. Agrawala, "Author's response to 'On mutual exclusion in computer networks' by Carvalho and Roucairol," Commun. ACM, vol. 26, pp. 147-148, Feb. 1983.

[4]

{4} I. Suzuki and T. Kasami, "A distributed mutual exclusion algorithm," ACM Trans. Comput. Syst., vol. 3, pp. 344-349, Nov. 1985.

Digital Library

[5]

{5} M. Maekawa, "A √N algorithm for mutual exclusion in decentralized systems," ACM Trans. Comput. Syst., vol. 3, pp. 145-159, Mar. 1985.

Digital Library

[6]

{6} D. Barbara and H. Garcia-Molina, "The reliability of voting mechanisms," IEEE Trans. Comput., vol. C-36, pp. 1197-1208, Oct. 1987.

[7]

{7} K. Raymond, "A tree-based algorithm for distributed mutual exclusion," ACM Trans. Comput. Syst., vol. 7, pp. 61-77, Feb. 1989.

Digital Library

[8]

{8} M. Mizuno, M. L. Neilsen, and R. Rao, "A token based distributed mutual exclusion algorithm based on quorum agreements," in Proc. 11th Int. Conf. Distributed Comput. Syst., May 1991, pp. 361-368.

[9]

{9} M. Singhal, "A class of deadlock-free maekawa-type algorithms for mutual exclusion in distributed systems," Distributed Comput., pp. 131-138, Apr. 1991.

Digital Library

[10]

{10} M. Raynal, "A simple taxonomy for distributed mutual exclusion algorithms," ACM Oper. Syst. Rev., vol. 25, no. 2, pp. 47-51, 1991.

Digital Library

[11]

{11} H. Garcia-Molina and D. Barbara, "How to assign votes in a distributed system," J. ACM, vol. 32, pp. 841-860, Oct. 1985.

Digital Library

[12]

{12} H. Kakugawa, S. Fujita, M. Yamashita, and T. Ae, "A protocol for distributed k-mutual exclusion," IEICE Japan, SIG Computation Record COMP91-28, pp. 57-64, June 1991.

[13]

{13} K. Raymond, "A distributed algorithm for multiple entries to a critical section," Inform. Processing Lett., vol. 30, pp. 189-193, Feb. 1989.

Digital Library

[14]

{14} P. K. Srimani and R. L. Reddy, "Another distributed algorithm for multiple entries to a critical section," Inform. Processing Lett., vol. 41, pp. 51-57, Jan. 1992.

Digital Library

[15]

{15} S. Fujita, M. Yamashita, and T. Ae, "A non trivial solution of the distributed k-mutual exclusion problem," ISA '91 Algorithms LNCS 557, 1991.

[16]

{16} T. Ibaraki and T. Kameda, "Theory of coteries," CSS/LCCR TR90-09, Simon Fraser Univ., Burnaby, B.C., Canada, 1990.

[17]

{17} M. Maekawa, A. E. Oldehoft, and R. R. Oldehoft, Operating Systems-Advanced Concept. Menlo, Park, CA: Benjamin/Cummings, 1987.

[18]

{18} M. Raynal, Algorithms for Mutual Exclusion. North Oxford Academic, 1886. (Translated by D. Beeson).

Cited By

Kamei SKakugawa H(2016)An Asynchronous Message-passing Distributed Algorithm for the Generalized Local Critical Section ProblemProceedings of the Fifth International Conference on Network, Communication and Computing10.1145/3033288.3033341(203-207)Online publication date: 17-Dec-2016
https://dl.acm.org/doi/10.1145/3033288.3033341
Kakugawa H(2015)Mutual inclusion in asynchronous message-passing distributed systemsJournal of Parallel and Distributed Computing10.1016/j.jpdc.2015.01.00377:C(95-104)Online publication date: 1-Mar-2015
https://dl.acm.org/doi/10.1016/j.jpdc.2015.01.003
Kakugawa H(2015)On the family of critical section problemsInformation Processing Letters10.1016/j.ipl.2014.08.012115:1(28-32)Online publication date: 1-Jan-2015
https://dl.acm.org/doi/10.1016/j.ipl.2014.08.012
Show More Cited By

Availability of k-Coterie
1. Software and its engineering
  1. Software organization and properties
    1. Software system structures

Recommendations

Estimating the Reliability of Regeneration-Based Replica Control Protocols

The accessibility of vital information can be enhanced by replicating the data on several sites and employing a consistency control protocol to manage the replicas. The reliability of a replicated data object depends on maintaining a viable set of ...
Coterie availability in sites
DISC'05: Proceedings of the 19th international conference on Distributed Computing

In this paper, we explore new failure models for multi-site systems, which are systems characterized by a collection of sites spread across a wide area network, each site formed by a set of computing nodes running processes. In particular, we introduce ...
Comments on "Availability of k-Coterie"

H. Kakugawa et al. (1993) proposed the k-majority coterie for the distributed k-mutual exclusion problem (k-mutex). It was claimed that the k-majority coterie is a k-coterie, which is a general solution for k-mutex. In this comment, we show that the k-...

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Computers

IEEE Transactions on Computers Volume 42, Issue 5

May 1993

134 pages

ISSN:0018-9340

Issue’s Table of Contents

Copyright © Copyright © 1993 IEEE. All Rights Reserved.

Publisher

IEEE Computer Society

United States

Publication History

Published: 01 May 1993

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

19
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Kamei SKakugawa H(2016)An Asynchronous Message-passing Distributed Algorithm for the Generalized Local Critical Section ProblemProceedings of the Fifth International Conference on Network, Communication and Computing10.1145/3033288.3033341(203-207)Online publication date: 17-Dec-2016
https://dl.acm.org/doi/10.1145/3033288.3033341
Kakugawa H(2015)Mutual inclusion in asynchronous message-passing distributed systemsJournal of Parallel and Distributed Computing10.1016/j.jpdc.2015.01.00377:C(95-104)Online publication date: 1-Mar-2015
https://dl.acm.org/doi/10.1016/j.jpdc.2015.01.003
Kakugawa H(2015)On the family of critical section problemsInformation Processing Letters10.1016/j.ipl.2014.08.012115:1(28-32)Online publication date: 1-Jan-2015
https://dl.acm.org/doi/10.1016/j.ipl.2014.08.012
Joung Y(2010)On quorum systems for group resources allocationDistributed Computing10.1007/s00446-010-0094-422:3(197-214)Online publication date: 1-Mar-2010
https://dl.acm.org/doi/10.1007/s00446-010-0094-4
Chaudhuri PEdward T(2008)An algorithm for k-mutual exclusion in decentralized systemsComputer Communications10.1016/j.comcom.2008.05.00931:14(3223-3235)Online publication date: 1-Sep-2008
https://dl.acm.org/doi/10.1016/j.comcom.2008.05.009
Miura KTagawa TKakugawa H(2006)A Quorum-Based Protocol for Searching Objects in Peer-to-Peer NetworksIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2006.217:1(25-37)Online publication date: 1-Jan-2006
https://dl.acm.org/doi/10.1109/TPDS.2006.2
Paquette MPelc A(2006)Optimal decision strategies in Byzantine environmentsJournal of Parallel and Distributed Computing10.1016/j.jpdc.2005.10.01166:3(419-427)Online publication date: 1-Mar-2006
https://dl.acm.org/doi/10.1016/j.jpdc.2005.10.011
Lawi AOda KYoshida T(2006)Quorum based distributed conflict resolution algorithm for bounded capacity resourcesProceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking10.1007/11942634_15(135-144)Online publication date: 4-Dec-2006
https://dl.acm.org/doi/10.1007/11942634_15
Manabe YTajima N(2004)(h, k)-Arbiters for h-out-of-k mutual exclusion problemTheoretical Computer Science10.5555/967703.967721310:1-3(379-392)Online publication date: 1-Jan-2004
https://dl.acm.org/doi/10.5555/967703.967721
Harada TYamashita M(2004)k-Coteries for Tolerating Network 2-PartitionIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2004.2315:7(666-672)Online publication date: 1-Jul-2004
https://dl.acm.org/doi/10.1109/TPDS.2004.23
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents