| Summary: | 碩士 === 東吳大學 === 資訊科學系 === 93 === k-Coterie is a graceful concept to solve the distributed k-mutual exclusion problem. The distributed k-mutual exclusion algorithm adopting k-coteries has the fault-tolerant capability when the system has node and/or communication link failures. However, the fault-tolerant capability of a distributed algorithm depends on the performance of a k-coterie it adopts. The performance of a k-coterie is usually measured by availability. High availability of a k-coterie exhibits a high fault-tolerant capability for the distributed algorithm adopting the k-coterie. The complemental k-coterie is an important class of k-coteries, which can robust the network 2-partition caused by the communication network failures. In this paper, we propose a way to recognize complmental k-coteries by using availability. By evaluating the availability of a k-coterie, instead of using a formal proof, the k-coterie can be recognized as a complemental k-coterie or not. Finally, we apply our results to some well-known k-coteries.
|
|---|
