I'm trying to find a leader election algorithm given a directed graph. What I've found till now is that most LE algorithms have a ring network or a mesh topology. Can anyone suggest me some algorithms?
Asked
Active
Viewed 792 times
0
-
1Perhaps this would be better asked on cstheory.stackexchange.com – Ted Hopp Apr 27 '12 at 15:26
-
thanks for the suggestion! i didn't come across that website b4 and it looks cool!:) – Amaar Bokhari Apr 27 '12 at 15:30
-
If it is not a research question, maybe posting to http://cs.stackexchange.com/ is better – Vitaly Olegovitch Apr 27 '12 at 16:51
-
I think this is related to distributed systems. – Enrique Apr 27 '12 at 18:31
1 Answers
2
"An introduction to Distributed Algorithms" by Tel covers this in chapter 7. Here are some mentions that might be search terms "tree algorithm" - fairly straightforward algorithm to find the min on a tree. Finn's algorithm is a reference to a Wave algorithm from a previous chapter which would be relatively inefficient if used for leader election. Tel says the leader election problem on arbitrary networks is closely related to spanning tree creation and describes Gallager-Humblet-Spira. Korach-Kutten-Moran apparently describe how to turn a traversal algorithm for general networks into a leader election algorithm.
mcdowella
- 19,301
- 2
- 19
- 25