Deadlock-Free Information Structure Distributed Mutual Exclusion Algorithms


In the distributed mutual exclusion problem, a set of processes must coordinate their actions so that at any time at most one process may be within its critical section. Information structure distributed mutual exclusion algorithms (ISDME) are instances of a general algorithm which can represent several non-token-based algorithms. This paper introduces a… (More)


2 Figures and Tables