339 search results - page 13 / 68 » Performance of Fair Distributed Mutual Exclusion Algorithms |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
-- Electing leader is a vital issue not only in distributed computing but also in communication network [1, 2, 3, 4, 5], centralized mutual exclusion algorithm [6, 7], centralized ...
CONCUR
2003
Springer
14 years 21 days ago
2003
Springer
Abstract. We apply the theory of asynchronous automata to the synthesis problem of closed distributed systems. We use safe asynchronous automata as implementation model, and charac...
PPOPP
2005
ACM
14 years 1 months ago
2005
ACM
In this paper we present a new form of revocable lock that streamlines the construction of higher level concurrency abstractions such as atomic multi-word heap updates. The key id...
MOBIHOC
2002
ACM
14 years 7 months ago
2002
ACM
Due to hidden terminals and a dynamic topology, contention among stations in an ad-hoc network is not homogeneous. Some stations are at a disadvantage in opportunity of access to ...
LOPSTR
2004
Springer
14 years 25 days ago
2004
Springer
We propose an analysis for detecting procedures and goals that are deterministic (i.e. that produce at most one solution), or predicates whose clause tests are mutually exclusive (...