339 search results - page 40 / 68 » Performance of Fair Distributed Mutual Exclusion Algorithms |
SENSYS
2009
ACM
14 years 2 months ago
2009
ACM
Network protocols are typically designed and tested individually. In practice, however, applications use multiple protocols concurrently. This discrepancy can lead to failures fro...
EMSOFT
2006
Springer
13 years 11 months ago
2006
Springer
We present a deadlock avoidance algorithm for distributed systems that guarantees liveness. Deadlock avoidance in distributed systems is a hard problem and general solutions are c...
SIGMETRICS
1998
ACM
13 years 7 months ago
1998
ACM
Implicitcoscheduling is a distributed algorithm fortime-sharing communicating processes in a cluster of workstations. By observing and reacting to implicit information, local sche...
ADHOCNOW
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. This paper investigates the challenges involve in designing a dynamic channel assignment (DCA) scheme for wireless mesh networks, particularly for multi-radio systems. It...
CIAC
2000
Springer
13 years 12 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...