New Constructions for Nondominated k-Coteries
Eun-Hye Choi, Tatsuhiro Tsuchiya, Tohru Kikuno · OUKA (Osaka University Knowledge Archive) (Osaka University) · 2000
The k-mutual exclusion problem is the problem of guaranteeing that no more than k computing nodes enter a critical section simultaneously.The use of a k-coterie, which is a special set of node groups, is known as a robust approach to this problem.In general, k-coteries are classified as either dominated or nondominated, and a mutual exclusion mechanism has maximal availability when it employs a nondominated k-coterie.In this paper, we propose two new schemes called VOT and D-VOT for constructing nondominated k-coteries.We conduct a comparative evaluation of the proposed schemes and well-known previous schemes.The results clearly show the superiority of the proposed schemes.