Sciweavers

123 search results - page 6 / 25
» Stable Leader Election
Sort
View
DSN
2006
IEEE
14 years 1 months ago
Eventual Leader Election with Weak Assumptions on Initial Knowledge, Communication Reliability, and Synchrony
This paper considers the eventual leader election problem in asynchronous message-passing systems where an arbitrary number t of processes can crash (t < n, where n is the tota...
Antonio Fernández, Ernesto Jiménez, ...
WDAG
2010
Springer
185views Algorithms» more  WDAG 2010»
13 years 6 months ago
Leader Election Problem versus Pattern Formation Problem
Leader election and arbitrary pattern formation are fundammental tasks for a set of autonomous mobile robots. The former consists in distinguishing a unique robot, called the lead...
Yoann Dieudonné, Franck Petit, Vincent Vill...
WDAG
2001
Springer
100views Algorithms» more  WDAG 2001»
14 years 5 days ago
A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings
A new, self-stabilizing algorithm for electing a leader on a unidirectional ring of prime size is presented for the composite atomicity model with a centralized daemon. Its space c...
Faith E. Fich, Colette Johnen
IPPS
2007
IEEE
14 years 2 months ago
Average Execution Time Analysis of a Self-stabilizing Leader Election Algorithm
This paper deals with the self-stabilizing leader election algorithm of Xu and Srimani [10] that finds a leader in a tree graph. The worst case execution time for this algorithm ...
Juan Paulo Alvarado-Magaña, José Alb...
PODC
1999
ACM
14 years 1 days ago
Memory Space Requirements for Self-Stabilizing Leader Election Protocols
We study the memory requirements of self-stabilizing leader election (SSLE) protocols. We are mainly interested in two types of systems: anonymous systems and id-based systems. We...
Joffroy Beauquier, Maria Gradinariu, Colette Johne...