Issue No. 03 - September (1989 vol. 1)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.87983
<p>In the weighted voting protocol which is used to maintain the consistency of replicated data, the availability of the data to ready and write operations not only depends on the availability of the nodes storing the data but also on the vote and quorum assignments used. The authors consider the problem of determining the vote and quorum assignments that yield the best performance in a distributed system where node availabilities can be different and the mix of the read and write operations is arbitrary. The optimal vote and quorum assignments depend not only on the system parameters, such as node availability and operation mix, but also on the performance measure. The authors present an enumeration algorithm that can be used to find the vote and quorum assignments that need to be considered for achieving optimal performance. When the performance measure is data availability, an analytical method is derived to evaluate it 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 enumeration algorithm can also be used to obtain the optimal performance when other measures are considered.</p>
vote optimizing; quorum assignments; reading; writing replicated data; weighted voting protocol; distributed system; node availabilities; operation mix; enumeration algorithm; optimal performance; distributed processing; fault tolerant computing; protocols
M. Ammar, S. Cheung and M. Ahamad, "Optimizing Vote and Quorum Assignments for Reading and Writing Replicated Data," in IEEE Transactions on Knowledge & Data Engineering, vol. 1, no. , pp. 387-397, 1989.