Advertisement

A Quorum Based Group k-Mutual Exclusion Algorithm for Open Distributed Environments

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3758)

Abstract

This paper presents a quorum-based group k-mutual exclusion algorithm for open distributed computing systems that can evolve their behavior based on membership changes in the environment. The algorithm consists of two main layers; the quorum-consensus and quorum-reconfiguration. The quorum consensus layer is used to handle requests from and to the application layer, and it directly adopts a proposed k-coterie based algorithm of the group k-mutual exclusion in the static environments without any change to its protocol. Thus, the message complexity and quorum availability are the same as in the static environments. The quorum reconfiguration reconstructs information structure of the k-coterie by simply implementing the properties of two quorum input operations called coterie-join and coterie-cross. The reconfiguration layer is simple to use and has a great ability to complete any operation during reconfiguration powerfully thus system does not enter the halt state.

Keywords

Application Layer Critical Section Mutual Exclusion Message Complexity Membership Change 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Vidyasankar, K.: A simple group mutual ℓ-exclusion algorithm. Information Processing Letters 85, 79–85 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Agrawal, D., Abbadi, A.E.: An efficient and fault-tolerant algorithm for distributed mutual exclusion. ACM Trans. Computer Systems 9, 1–20 (1991)CrossRefGoogle Scholar
  3. 3.
    Garcia-Molina, H., Barbara, D.: How to assign votes in a distributed system. Journal of the ACM 32, 841–860 (1985)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Joung, Y.J.: Quorum-based algorithms for group mutual exclusion. IEEE Transaction on Parallel and Distributed Systems 14, 463–476 (2003)CrossRefGoogle Scholar
  5. 5.
    Schlichting, R., Schneider, F.: Fail-stop processors: an approach to designing fault-tolerant computing systems. ACM Trans. Computer Systems 1, 222–238 (1983)CrossRefGoogle Scholar
  6. 6.
    Lawi, A., Oda, K., Yoshida, T.: A simple quorum reconfiguration for open distributed environments. In: Proc. International Conference on Parallel and Distributed Systems (ICPADS), July 2005, vol. II, pp. 664–668 (2005)Google Scholar
  7. 7.
    Fujita, S., Yamashita, M., Ae, T.: Distributed k-mutual exclusion problem and k-coteries. In: Hsu, W.-L., Lee, R.C.T. (eds.) ISA 1991. LNCS, vol. 557, pp. 22–31. Springer, Heidelberg (1991)Google Scholar
  8. 8.
    Neilsen, M.L., Mizuno, M.: Coterie join algorithm. IEEE Trans. Parallel and Dist. Systems 3, 582–590 (1992)CrossRefMathSciNetGoogle Scholar
  9. 9.
    Jiang, J.R., Huang, S.T.: Obtaining nondominated k-coteries for fault-tolerant distributed k-mutual exlusion. In: Proc. International Conference on Parallel and Distributed Systems (ICPADS), pp. 582–587 (1994)Google Scholar
  10. 10.
    Maekawa, M.: A \(\sqrt{N}\) algorithm for mutual exclusion in decentralized systems. ACM Trans. Computer Systems 3, 145–159 (1985)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  1. 1.Porgram of Creation InformaticsKyushu Institute of TechnologyFukuokaJapan

Personalised recommendations