Sciweavers

231 search results - page 22 / 47
» Asynchronous failure detectors
Sort
View
83
Voted
SRDS
2010
IEEE
14 years 7 months ago
Swift Algorithms for Repeated Consensus
We introduce the notion of a swift algorithm. Informally, an algorithm that solves the repeated consensus is swift if, in a partial synchronous run of this algorithm, eventually no...
Fatemeh Borran, Martin Hutle, Nuno Santos, Andr&ea...
OPODIS
2008
14 years 11 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
BIRTHDAY
2003
Springer
15 years 2 months ago
Distributed Cooperation and Adversity: Complexity Trade-Offs
The problem of cooperatively performing a collection of tasks in a decentralized setting where the computing medium is subject to adversarial perturbations is one of the fundament...
Chryssis Georgiou, Alexander Russell, Alexander A....
JACM
2000
77views more  JACM 2000»
14 years 9 months ago
The fault span of crash failures
A crashing network protocol is an asynchronous protocol whose memory does not survive crashes. We show that a crashing network protocol that works over unreliable links can be driv...
George Varghese, Mahesh Jayaram
IPPS
1998
IEEE
15 years 1 months ago
The Timewheel Group Membership Protocol
Abstract. We describe a group membership protocol, called the timewheel group membership protocol, for a timed asynchronous distributed system. This protocol is a part of the timew...
Shivakant Mishra, Christof Fetzer, Flaviu Cristian