Sciweavers

117 search results - page 3 / 24
» Fail-Aware Failure Detectors
Sort
View
JACM
2010
104views more  JACM 2010»
13 years 4 months ago
Tight failure detection bounds on atomic object implementations
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...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
SIAMCOMP
2000
74views more  SIAMCOMP 2000»
13 years 5 months ago
On Quiescent Reliable Communication
We study the problem of achieving reliable communication with quiescent algorithms (i.e., algorithms that eventually stop sending messages) in asynchronous systems with process cra...
Marcos Kawazoe Aguilera, Wei Chen, Sam Toueg
TC
2002
13 years 5 months ago
Fast Asynchronous Uniform Consensus in Real-Time Distributed Systems
We investigate whether asynchronous computational models and asynchronous algorithms can be considered for designing real-time distributed fault-tolerant systems. A priori, the lac...
Jean-François Hermant, Gérard Le Lan...
CORR
2008
Springer
127views Education» more  CORR 2008»
13 years 5 months ago
Universe Detectors for Sybil Defense in Ad Hoc Wireless Networks
The Sybil attack in unknown port networks such as wireless is not considered tractable. A wireless node is not capable of independently differentiating the universe of real nodes f...
Adnan Vora, Mikhail Nesterenko, Sébastien T...
WDAG
2007
Springer
128views Algorithms» more  WDAG 2007»
14 years 4 days ago
From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors
Abstract. This paper studies the impact of omission failures on asynchronous distributed systems with crash-stop failures. We provide two different transformations for algorithms,...
Carole Delporte-Gallet, Hugues Fauconnier, Felix C...