Sciweavers

26 search results - page 5 / 6
» The weakest failure detector for solving k-set agreement
Sort
View
WDAG
1997
Springer
92views Algorithms» more  WDAG 1997»
13 years 10 months ago
Heartbeat: A Timeout-Free Failure Detector for Quiescent Reliable Communication
Abstract. We study the problem of achieving reliable communication with quiescent algorithms (i.e., algorithms that eventually stop sending messages) in asynchronous systems with p...
Marcos Kawazoe Aguilera, Wei Chen, Sam Toueg
DSN
2003
IEEE
13 years 11 months ago
Comparison of Failure Detectors and Group Membership: Performance Study of Two Atomic Broadcast Algorithms
Protocols that solve agreement problems are essential building blocks for fault tolerant distributed systems. While many protocols have been published, little has been done to ana...
Péter Urbán, Ilya Shnayderman, Andr&...
DC
1999
13 years 5 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
DSN
2002
IEEE
13 years 11 months ago
Performance Analysis of a Consensus Algorithm Combining Stochastic Activity Networks and Measurements
Protocols which solve agreement problems are essential building blocks for fault tolerant distributed applications. While many protocols have been published, little has been done ...
Andrea Coccoli, Péter Urbán, Andrea ...
WDAG
2005
Springer
157views Algorithms» more  WDAG 2005»
13 years 11 months ago
(Almost) All Objects Are Universal in Message Passing Systems
d Abstract) Carole Delporte-Gallet1 , Hugues Fauconnier2 , and Rachid Guerraoui3 1 ESIEE-IGM Marne-La-Vallee, France 2 LIAFA Univ Paris VII, France 3 EPFL Lausanne, Switzerland Thi...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...