You are viewing a plain text version of this content. The canonical link for it is here.
Posted to dev@zookeeper.apache.org by Andrey Kuzmin <an...@gmail.com> on 2009/04/13 22:17:04 UTC

ZooKeeper's leader election algorithm details?

I'd like to take a look at formal description of the leader election
algorithm ZooKeeper implements (if it's not standard 'bully'). Is it
available?

Regards,
Andrey

Re: ZooKeeper's leader election algorithm details?

Posted by Flavio Junqueira <fp...@yahoo-inc.com>.
Andrey, We can't use bully because we have to determine the server  
with highest zxid, and servers do not know it beforehand. They know  
each others' ids, but not the last zxid each one processed.

Could you be more explicit on what you mean with a more formal  
description? What kind of information are you after?

-Flavio

On Apr 13, 2009, at 10:17 PM, Andrey Kuzmin wrote:

> I'd like to take a look at formal description of the leader election
> algorithm ZooKeeper implements (if it's not standard 'bully'). Is it
> available?
>
> Regards,
> Andrey


Re: ZooKeeper's leader election algorithm details?

Posted by Mahadev Konar <ma...@yahoo-inc.com>.
Hi andrew,
  You should be able to read about leader election in the presentation at
http://wiki.apache.org/hadoop/ZooKeeper/ZooKeeperPresentations

Specifically the last one at UPC. It explains the leader election in the ppt
slides. We should also document it somewhere on the wiki or in our forrest
docs so that its easier for others to read through it.

In case you have any questions feel free to post them on this list.

Thanks
mahadev


On 4/13/09 1:17 PM, "Andrey Kuzmin" <an...@gmail.com> wrote:

> I'd like to take a look at formal description of the leader election
> algorithm ZooKeeper implements (if it's not standard 'bully'). Is it
> available?
> 
> Regards,
> Andrey