The mutual exclusion (MX) paradigm can be used as a building block in many practical problems such as group communication, atomic commitment and replicated data management where the exclusive use of an object might be useful. The problem has been widely studied in the research community since one reason for this wide interest is that many distributed protocols need a mutual exclusion protocol. ...

Mutual exclusion is not solvable in an asynchronous message-passing system where processes are subject to crash failures. Delporte-Gallet et. al. determined the weakest failure detector to solve this problem when a majority of processes are correct. Here we identify the weakest failure detector to solve mutual exclusion in any environment, i.e., regardless of the number of faulty processes. We ...

The k-local mutual exclusion is a generalization of local mutual exclusion problem introduced by Attiya et al.. In k-local mutual exclusion, it is assumed that the k identical copies of a resource are shared among the geographically close nodes. The paper proposes a solution to the k-local mutual exclusion problem in MANETs. The algorithm uses a leader-based approach and the leader is equipped ...

The term mutual exclusion is used to designate an extreme form of interference which often occurs when two phage particles attack the same host cell. The cell liberates numerous particles of one of the parental types and not a single particle of the other parental type (Delbruck and Luria, 1942; Dulbriick, 1945). Mutual exclusion is the rule when the two infecting particles are very dissimilar....

One way of characterizing non-token-based mutual exclusion (m.e.) algorithms is in terms of the underlying information structure. The information structure for a given m.e. algorithm specifies which particular processes interact with which other processes before entering their critical sections, and which processes they interact with when leaving their critical sections. By focusing on the info...

Mutual exclusion primitives based on user-level atomic instructions (often called spin locks) have proven to be much more eecient than operating-system semaphores in situations where the contention on the semaphore is low. However, many of these spin lock schemes do not permit registration of ownership to be carried out atomically with acquisition, potentially leaving the ownership undetermined...

 Deconstructing Queue-Based Mutual Exclusion

The Internet motivated video streaming systems are largely complicated by issues such as a high degree of network resource sharing amongst many flows, which potentially leads to deadlocks. Using concepts of siphons along with their corresponding dangerous markings, we derive an algebraically necessary and sufficient characterization for such a much undesirable situation. The target system is as...

We present a wait-free solution to the generalized dining philosophers problem under eventual weak exclusion in environments subject to crash faults. Wait-free dining guarantees that every correct hungry process eventually eats, regardless of process crashes. Eventual weak exclusion (3WX ) actually allows scheduling mistakes, whereby mutual exclusion may be violated finitely-many times; for eac...