In this paper, we propose a distributed algorithm for solving the h-out of-k mutual exclusion problem with the aid of a specific k-coterie - cohorts coterie. The proposed algorithm is resilient to node and/or link failures, and has constant message cost i
關聯:
PARALLEL AND DISTRIBUTED COMPUTING: APPLICATIONS AND TECHNOLOGIES, PROCEEDINGS
