123 search results - page 5 / 25 » Stable Leader Election |
WDAG
1998
Springer
13 years 12 months ago
1998
Springer
The paper addresses the problemof solving classic distributed algorithmic problems under the practical model of Broadcast Communication Networks. Our main result is a new Leader El...
WDAG
2000
Springer
13 years 11 months ago
2000
Springer
This paper presents a scalable leader election protocol for large process groups with a weak membership requirement. The underlying network is assumed to be unreliable but characte...
DSN
2007
IEEE
14 years 2 months ago
2007
IEEE
This paper considers the problem of electing an eventual leader in an asynchronous shared memory system. While this problem has received a lot of attention in messagepassing syste...
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
We propose a new self-stabilizing anonymous leader election algorithm in a tree graph. We show the correctness of the protocol and show that the protocol terminates in O(n4 ) time...
FMCO
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We compare the expressive power of process calculi by studying the problem of electing a leader in a symmetric network of processes. We consider the π-calculus with mixe...