Optimizing vote and quorum assignments for reading and writing replicated data

The problem is discussed of determining the vote assignment and quorum that yields the highest availability in a system where node availabilities can be different and the mix of the read and write operations is arbitrary. For this purpose, an enumeration algorithm is presented that can be used to find the vote and quorum assignments that need to be considered for achieving optimal availability. An analytical method is derived to evaluate the availability of a given system for any vote and quorum assignment. This method and the enumeration algorithm are used to find the optimal vote and quorum assignment for several systems. The algorithm can also be used to obtain the optimal performance when other measures are considered.<
>