General Tree k-Coteries to Reduce the Degradation of Quorums
Yu‐Chen Kuo · The Computer Journal · 2009
k-Coterie is a useful concept to solve the distributed k-mutual exclusion problem. The distributed k-mutual exclusion algorithms based on k-coteries have benefits of the high fault-tolerance and the low message cost. Harada and Yamashita proposed a basic tree structure to construct tree k-coteries. When the root fails, quorums are degraded and their sizes grow rapidly. In this paper, we propose the general tree structure to construct general tree 1-coteries to reduce the degradation of quorums. In the general tree 1-coterie, the responsibility of the root to construct small quorums could be adjusted. When the root fails, the degradation of quorums could be reduced. Then, we propose the coterie root-join operation to construct general tree k-coteries by root-joining k general tree 1-coteries at a common root. In the general tree k-coterie, the degradation of quorums and the quorum size could be reduced at same time. We show that general tree k-coteries could be complemental. Thus, general tree k-coteries are resilient when the network is 2-partitioned.