8 search results - page 1 / 2 » Tight failure detection bounds on atomic object implementati... |
JACM
2010
13 years 5 months ago
2010
This article determines the weakest failure detectors to implement shared atomic objects in a distributed system with crash-prone processes. We first determine the weakest failure...
WDAG
1994
Springer
13 years 11 months ago
1994
Springer
We give an optimal, wait-free implementation of an increment register. An increment register is a concurrent object consisting of an integer-valued register with an increment oper...
WORDS
2003
IEEE
14 years 2 days ago
2003
IEEE
Atomic Broadcast (where all processes deliver broadcast messages in the same order) is a very useful group communication primitive for building fault-tolerant distributed systems....
DSN
2006
IEEE
13 years 10 months ago
2006
IEEE
This paper establishes tight bounds on the best-case time-complexity of distributed atomic read/write storage implementations that tolerate worst-case conditions. We study asynchr...
SWAT
2004
Springer
14 years 4 days ago
2004
Springer
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...