An asynchronous message-passing distributed algorithm for the generalized local critical section problem (Q1662701): Difference between revisions

Summary: This paper discusses the generalized local version of critical section problems including mutual exclusion, mutual inclusion, \(k\)-mutual exclusion and \(l\)-mutual inclusion. When a pair of numbers \((l_i, k_i)\) is given for each process \(P_i\), it is the problem of controlling the system in such a way that the number of processes that can execute their critical sections at a time is at least \(l_i\) and at most \(k_i\) among its neighboring processes and \(P_i\) itself. We propose the first solution for the generalized local \((l_i, | N_i | + 1)\)-critical section problem (i.e., the generalized local \(l_i\)-mutual inclusion problem). Additionally, we show the relationship between the generalized local \((l_i, k_i)\)-critical section problem and the generalized local \((| N_i | + 1 - k_i, | N_i | + 1 - l_i)\)-critical section problem. Finally, we propose the first solution for the generalized local \((l_i, k_i)\)-critical section problem for arbitrary \((l_i, k_i)\), where \(0 \leq l_i < k_i \leq | N_i | + 1\) for each process \(P_i\).