AbstractThe shared memory requirements of Dijkstra′s mutual exclusion problem are examined. It is shown that n binary shared variables are necessary and sufficient to solve the problem of mutual exclusion with guaranteed global progress for n processes using only atomic reads and writes of shared variables for communication
The Group Mutual Exclusion (GME) problem, introduced by Joung, is a nat-ural extension of the classi...
We present two algorithms for the Group Mutual Exclusion (GME) Problem that satisfy the properties o...
A simplification of the mutual exclusion algorithm of Lycklama and Hadzilacos is presented. It uses ...
AbstractThe shared memory requirements of Dijkstra′s mutual exclusion problem are examined. It is sh...
Dijkstra introduced mutual exclusion for an N-process system as the requirement “that at any moment ...
Most weak memory consistency models are incapable of supporting a solution to mutual exclusion using...
In distributed shared memory multiprocessors, remote memory accesses generate processor-to-memory tr...
We prove an Ω(n logn) lower bound on the number of non-busywaiting memory accesses by any determinis...
A new elegant and simple algorithm for mutual exclusion of N processes is proposed. It only requires...
The ℓ-exclusion problem is to design an algorithm which guarantees that up to ℓ processes and no mor...
AbstractThe mutual exclusion problem in a distributed system, in which each process has a memory of ...
AbstractThe problem of implementing mutual exclusion of N asynchronous parallel processes in a model...
Abstract—Amutual exclusion mechanism that is both fair and space efficient can be highly valuable fo...
We establish trade-o s between time complexity and write- and access-contention for solutions to the...
Abstract A new elegant and simple algorithm for mutual exclusion of N processes is proposed. It only...
The Group Mutual Exclusion (GME) problem, introduced by Joung, is a nat-ural extension of the classi...
We present two algorithms for the Group Mutual Exclusion (GME) Problem that satisfy the properties o...
A simplification of the mutual exclusion algorithm of Lycklama and Hadzilacos is presented. It uses ...
AbstractThe shared memory requirements of Dijkstra′s mutual exclusion problem are examined. It is sh...
Dijkstra introduced mutual exclusion for an N-process system as the requirement “that at any moment ...
Most weak memory consistency models are incapable of supporting a solution to mutual exclusion using...
In distributed shared memory multiprocessors, remote memory accesses generate processor-to-memory tr...
We prove an Ω(n logn) lower bound on the number of non-busywaiting memory accesses by any determinis...
A new elegant and simple algorithm for mutual exclusion of N processes is proposed. It only requires...
The ℓ-exclusion problem is to design an algorithm which guarantees that up to ℓ processes and no mor...
AbstractThe mutual exclusion problem in a distributed system, in which each process has a memory of ...
AbstractThe problem of implementing mutual exclusion of N asynchronous parallel processes in a model...
Abstract—Amutual exclusion mechanism that is both fair and space efficient can be highly valuable fo...
We establish trade-o s between time complexity and write- and access-contention for solutions to the...
Abstract A new elegant and simple algorithm for mutual exclusion of N processes is proposed. It only...
The Group Mutual Exclusion (GME) problem, introduced by Joung, is a nat-ural extension of the classi...
We present two algorithms for the Group Mutual Exclusion (GME) Problem that satisfy the properties o...
A simplification of the mutual exclusion algorithm of Lycklama and Hadzilacos is presented. It uses ...
DOI
Add to ORKG