This site best when viewed with a modern standards-compliant browser. We recommend Firefox Get Firefox!.

Linux-HA project logo
Providing Open Source High-Availability Software for Linux and other OSes since 1999.

USA Flag UK Flag

Japanese Flag

Homepage

About Us

Contact Us

Legal Info

How To Contribute

Security Issues

18 August 2008 Heartbeat release 2.1.4 is now out Download it and install it!

11 October 2007 NEW educational HA/DR Blog hosted by Alan Robertson

9 April 2007 Check out the Cool Heartbeat Screencasts: Installation, Intro to the GUI Part of the Heartbeat Education project

Last site update:
2008-08-20 19:09:08

Quorum

Quorum is the name given to a mechanism which is intended to help solve the SplitBrain problem, by selecting no more than one ClusterPartition when failures in cluster communication cause the cluster to split into multiple ClusterPartitions.

Once a ClusterPartition is selected to have quorum, that partition can run services for the cluster.

The most well-known method of awarding quorum to a ClusterPartition for an n-node cluster for quorum is to award quorum to that partition which has more than n/2 nodes in it.

Of course, this causes problems for the case where n is 2, since any failure at all will cause the entire cluster to shut down.

To aid in this problem, there are a variety of other methods available to compute quorum, or break ties in quorum voting.

In Linux-HA, we provide a QuorumDaemon to help resolve this situation.

See Also

Split-brain, quorum, fencing overview, SplitBrain, fencing, QuorumDaemon