65 search results - page 3 / 13 » When does a correct mutual exclusion algorithm guarantee mut... |
EUROPAR
2006
Springer
13 years 11 months ago
2006
Springer
This paper is motivated by a need of practical asynchronous network systems, i.e., a wait-free distributed mutual exclusion algorithm (WDME). The WDME algorithm is very appealing w...
IPPS
2000
IEEE
13 years 11 months ago
2000
IEEE
A self-stabilizing algorithm, regardless of the initial system state, converges in finite time to a set of states that satisfy a legitimacy predicate without the need for explici...
DC
2007
13 years 7 months ago
2007
We present an adaptive algorithm for N-process mutual exclusion under read/write atomicity in which all busy waiting is by local spinning. In our algorithm, each process p perform...
PODC
2010
ACM
13 years 11 months ago
2010
ACM
Mutual exclusion is a fundamental distributed coordination problem. Shared-memory mutual exclusion research focuses on local-spin algorithms and uses the remote memory references ...
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
A number of solutions have been proposed for the problem of mutual exclusion in distributed systems. Some of these approaches have since been extended to a prioritized environment...