New constructions for nondominated k-coteries

The k-mutual exclusion problem is the problem of guaranteeing that no more than Ic 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 a pproach to this problem. In general, k-coteries are classified as either do minated or nondominated, and a mutual exclusion mechanism has maximal avail ability when it employs a nondominated k-coterie. In this paper, we propose tno new schemes called VOT and D-VOT for constructing nondominated k-coter ies. We conduct a comparative evaluation of the proposed schemes and well-k nown previous schemes. The results clearly show the superiority of the prop osed schemes.