The distributed k-mutual exclusion problem is the problem of guaranteeing that at most k processes can enter a critical section at a time in a distributed system. The distributed 1-mutual exclusion problem is one of fundamental distributed problems in distributed systems and many algorithms for solving the problem have been proposed. In this paper, we introduce the k-coterie as an extension of ...

I discuss Haldane's concept of generalised exclusion statistics (Phys. Rev. Lett. 67, 937, 1991) and I show that it leads to inconsistencies in the calculation of the particle distribution that maximizes the partition function. These inconsistencies appear when mutual exclusion statistics is manifested between different subspecies of particles in the system. In order to eliminate these inconsis...

When a process attempts to acquire a mutex lock, it may be forced to wait if another process currently holds the lock. In certain applications, such as real-time operating systems and databases, indefinite waiting can cause a process to miss an important deadline [20]. Hence, there has been research on designing abortable mutual exclusion locks, and fairly efficient algorithms of O(log n) RMR c...