Sciweavers

30 search results - page 3 / 6
» The weakest failure detectors to solve certain fundamental p...
Sort
View
OPODIS
2008
13 years 9 months ago
Solving Atomic Multicast When Groups Crash
In this paper, we study the atomic multicast problem, a fundamental abstraction for building faulttolerant systems. In the atomic multicast problem, the system is divided into non...
Nicolas Schiper, Fernando Pedone
IPPS
2009
IEEE
14 years 2 months ago
The Weak Mutual Exclusion problem
In this paper we define the Weak Mutual Exclusion (WME) problem. Analogously to classical Distributed Mutual Exclusion (DME), WME serializes the accesses to a shared resource. Di...
Paolo Romano, Luís Rodrigues, Nuno Carvalho
JPDC
2008
103views more  JPDC 2008»
13 years 7 months ago
On termination detection in crash-prone distributed systems with failure detectors
We investigate the problem of detecting termination of a distributed computation in systems where processes can fail by crashing. Specifically, when the communication topology is ...
Neeraj Mittal, Felix C. Freiling, Subbarayan Venka...
JSA
2008
108views more  JSA 2008»
13 years 7 months ago
A methodology to design arbitrary failure detectors for distributed protocols
Nowadays, there are many protocols able to cope with process crashes, but, unfortunately, a process crash represents only a particular faulty behavior. Handling tougher failures (...
Roberto Baldoni, Jean-Michel Hélary, Sara T...
PDP
2002
IEEE
14 years 11 days ago
Eventually Consistent Failure Detectors
The concept of unreliable failure detector was introduced by Chandra and Toueg as a mechanism that provides information about process failures. This mechanism has been used to sol...
Mikel Larrea, Antonio Fernández, Sergio Ar&...