Sciweavers

19 search results - page 3 / 4
» Optimistic Asynchronous Atomic Broadcast
Sort
View
DSN
2006
IEEE
14 years 1 months ago
Randomized Intrusion-Tolerant Asynchronous Services
Randomized agreement protocols have been around for more than two decades. Often assumed to be inefficient due to their high expected communication and time complexities, they ha...
Henrique Moniz, Nuno Ferreira Neves, Miguel Correi...
ICDCS
2009
IEEE
14 years 4 months ago
Implementing a Register in a Dynamic Distributed System
Providing distributed processes with concurrent objects is a fundamental service that has to be offered by any distributed system. The classical shared read/write register is one ...
Roberto Baldoni, Silvia Bonomi, Anne-Marie Kermarr...
SIAMCOMP
2000
74views more  SIAMCOMP 2000»
13 years 7 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
DC
1999
13 years 7 months ago
A Simple and Fast Asynchronous Consensus Protocol Based on a Weak Failure Detector
or fault-tolerant asynchronous systems. It abstracts a family of problems known as Agreement (or Coordination) problems. Any solution to consensus can serve as a basic building blo...
Michel Hurfin, Michel Raynal
TC
2002
13 years 7 months ago
The Timewheel Group Communication System
This paper describes a group communication system called the timewheel group communication system that has been designed for a timed asynchronous distributed system model. The tim...
Shivakant Mishra, Christof Fetzer, Flaviu Cristian