Sciweavers

123 search results - page 10 / 25
» Stable Leader Election
Sort
View
IPPS
2007
IEEE
14 years 2 months ago
Fast Failure Detection in a Process Group
Failure detectors represent a very important building block in distributed applications. The speed and the accuracy of the failure detectors is critical to the performance of the ...
Xinjie Li, Monica Brockmeyer
TC
1998
13 years 7 months ago
Optimal Elections in Faulty Loop Networks and Applications
—Loop networks (or Hamiltonian circulant graphs) are a popular class of fault-tolerant network topologies which include rings and complete graphs. For this class, the fundamental...
Bernard Mans, Nicola Santoro
ASIAN
2003
Springer
170views Algorithms» more  ASIAN 2003»
14 years 1 months ago
Model Checking Probabilistic Distributed Systems
Protocols for distributed systems make often use of random transitions to achieve a common goal. A popular example are randomized leader election protocols. We introduce probabilis...
Benedikt Bollig, Martin Leucker
OPODIS
2007
13 years 9 months ago
From an Intermittent Rotating Star to a Leader
Considering an asynchronous system made up of n processes and where up to t of them can crash, finding the weakest assumptions that such a system has to satisfy for a common leade...
Antonio Fernández Anta, Michel Raynal
TPDS
2010
104views more  TPDS 2010»
13 years 6 months ago
From an Asynchronous Intermittent Rotating Star to an Eventual Leader
—Considering an asynchronous system made up of n processes and where up to t of them can crash, finding the weakest assumption that such a system has to satisfy for a common lea...
Antonio Fernández Anta, Michel Raynal