The Availability of Complemental k-Coteries
Yu‐Chen Kuo, Pei Ying Wu · The Computer Journal · 2007
k-Coterie is a graceful concept to solve the distributed k-mutual exclusion problem. The k-mutual exclusion algorithm adopting k-coteries could provide the fault-tolerant capability. The complementalness and the availability are two important metrics to measure the fault-tolerant capability of a k-coterie. Since those two metrics are defined under two different failure assumptions, for a given k-coterie, two independent works to measure those two metrics are necessary. In this paper, we derive the characteristics of the complemental k-coterie on its availability. With the characteristic, verifying the complementalness of a k-coterie and evaluating its availability could be combined together to reduce the redundant works on measuring the fault-tolerant capability of the k-coterie.