Christine Caulfield napsal(a): > On 05/02/14 16:02, Jan Friesse wrote: >> Chrissie, >> patch looks good but what will happen in following scenario: >> >> - 4 nodes (A B C D) and atb list is (A B C D). >> - A B and C D will split. So A B will get quorum >> - C will split from D >> - C will join D. So "previous" partition is C (for D node) and D (for C) >> node, and as you can see, no A or B. So according to comment, it will >> vote? >> > > Hmm good point. Maybe I need to make the algorithm dependant on the > previous membership list being more (maybe even twice as much) as the > current one. I'll have a think. > Another option may be to use tie-breaker ONLY if node is member of quorate partition (if this is not how atb works already). Regards, Honza > Thanks > Chrissie > > >> Honza >> >> Christine Caulfield napsal(a): >>> This patch adds more flexibility to the auto_tie_breaker feature of >>> votequorum. With this, not only can the lowest nodeid be used as >>> a tie breaker, but also the highest, or a node from a nominated list. >>> >>> If there is a list of nodes, the first node in the list that was not >>> part of the previous partition is used. This allows the user to >>> specify a preferred set of nodes but prevents a split-brain if the >>> cluster divides evenly with a node in each half. >>> >>> Signed-Off-By: Christine Caulfield <ccaulfie@xxxxxxxxxx> >>> >>> >>> >>> _______________________________________________ >>> discuss mailing list >>> discuss@xxxxxxxxxxxx >>> http://lists.corosync.org/mailman/listinfo/discuss >>> >> > _______________________________________________ discuss mailing list discuss@xxxxxxxxxxxx http://lists.corosync.org/mailman/listinfo/discuss
