A coterie‐based mutual exclusion algorithm for distributed systems allowing multiple process failures at arbitrary time
Shigeki Takekawa, Shin’ichi Wakabayashi, Tetsushi Koide · Systems and Computers in Japan · 2002
Abstract In this article, we propose a coterie‐based mutual exclusion algorithm for distributed systems allowing process failures at arbitrary time. The proposed algorithm is an extension of Maekawa's algorithm, which is a representative conventional method for distributed mutual exclusion based on coterie. The proposed algorithm realizes mutual exclusion by detecting process failures using timers, updating the coterie dynamically, and introducing the system to a state without failure. It has the following advantages. First, it inherits all advantages of Maekawa's algorithm, because it behaves in the same way as Maekawa's algorithm when there is no process failure. Also, it allowsk(