Distributed k-mutual exclusion problem and k-coteries

  • Satoshi Fujita
  • Masafumi Yamashita
  • Tadashi Ae
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 557)


The distributed k-mutual exclusion problem is the problem of guaranteeing that at most k processes are in a critical section simultaneously. This problem can be solved using the k-coterie: We first prepare a set (k-coterie) C of sets (quorums) Q of processes such that each k-set {Q1,⋯, Qk} of quorums in C contains a pair Qi and Qj (i≠j) intersecting each other. A process wishing to enter a critical section is required to collect a permission from each member of a quorum in C. Then at most k processes can be in a critical section because of the intersection property of k-coterie, and the (average) number of messages necessary for entering a critical section is in proportion to the (average) quorum size of C.

This paper proposes a new scheme for constructing a k-coterie with small quorums; the size of each quorum is O((1/ε)n(1+3ε)/2) when k=nε(0<ε<1/3) and \(O\left( {\sqrt n \log n} \right)\) when k=O(1).


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    K.Raymond, ”A tree-based algorithm for distributed mutual exclusion,” ACM Trans. Computer Systems, 7, 1 (Feb. 1989) pp. 61–77.Google Scholar
  2. [2]
    G.Ricart and A.K.Agrawala, ”An optimal algorithm for mutual exclusion in computer network,” Comm. of ACM, 24, 1 (Jan. 1981) pp. 9–17.Google Scholar
  3. [3]
    I.Suzuki and T.Kasami, ”A distributed mutual exclusion algorithm,” ACM Trans. Computer Systems, 3, 4 (Nov. 1985) pp. 344–349.Google Scholar
  4. [4]
    L.Lamport, ”Time, clocks, and the ordering of events in a distributed system,” Comm. of ACM, 21, 7 (July 1978) pp. 558–565.Google Scholar
  5. [5]
    M.Maekawa, ”A √n Algorithm for Mutual Exclusion in Decentralized Systems,” ACM Trans. on Computer Systems, 3, 2 (May 1985) pp. 145–159.Google Scholar
  6. [6]
    D.Agrawal and A.El Abbadi, ”An Efficient Solution to the Distributed Mutual Exclusion Problem (Preliminary Report),” Proc. of 8th PODC, (Aug. 1989) pp.193–200.Google Scholar
  7. [7]
    H.Garcia-Molina and D.Barbara, ”How to assign votes in a distributed system,” Journal of the ACM, 32, 4 (Oct. 1985) pp. 841–860.Google Scholar
  8. [8]
    H.Kakugawa, S.Fujita, M.Yamashita, and T.Ae, ”A protocol for distributed k-mutual exclusion,” IEICE Technical Report (to appear), in Japanese.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Satoshi Fujita
    • 1
  • Masafumi Yamashita
    • 1
  • Tadashi Ae
    • 1
  1. 1.Department of Electrical Engineering, Faculty of EngineeringHiroshima UniversityHoroshimaJapan

Personalised recommendations