18 search results - page 2 / 4 » Closing the complexity gap between FCFS mutual exclusion and... |
CORR
2010
Springer
13 years 5 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 ...
ENTCS
2002
13 years 5 months ago
2002
The perceived advantages of distributed systems, such as increased reliability and availability, are o set by the increased complexity of developing such applications. The develop...
CONCUR
2003
Springer
13 years 10 months 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...
DIAGRAMS
2006
Springer
13 years 9 months ago
2006
Springer
Illustrating a dynamic process with an arrow-containing diagram is a widespread convention in people's daily communications. In order to build a basis for capturing the struct...
DC
2006
13 years 5 months ago
2006
Some well-known primitive operations, such as compare-and-swap, can be used, together with read and write, to implement any object in a wait-free manner. However, this paper shows ...