165 search results - page 6 / 33 » Safety-Liveness Exclusion in Distributed Computing |
133
click to vote
ICPADS
1998
IEEE
15 years 10 months ago
1998
IEEE
: Three fast mutual exclusion algorithms using read-modify-write and atomic read/write registers are presented in a sequence, with an improvement from one to the next. The last alg...
134
click to vote
EUROPAR
2006
Springer
15 years 9 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...
154
Voted
PODC
2003
ACM
15 years 11 months ago
2003
ACM
We present a methodology for automatic discovery of synchronization algorithms. We built a tool and used it to automatically discover hundreds of new algorithms for the well-known ...
149
click to vote
EUROPAR
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. This article presents a fault tolerant extension for the NaimiTrehel token-based mutual exclusion algorithm. Contrary to the extension proposed by Naimi-Trehel, our appro...
224
Voted
OPODIS
2010
15 years 3 months ago
2010
We consider the problem of scheduling dependent real-time tasks for overloads on a multiprocessor system, yielding best-effort timing assurance. The application/scheduling model in...