Efficient algorithm for evaluating the availability of multidimensional voting

Voting is a fault-tolerant technique to synchronize conflict operations on shared resources in a faulty distributed system. Multidimensional voting is a generalization of traditional weighted voting. The availability of a voting system is determined by the vote and quorum assignments. In this paper, we present and O(n^k+1) efficient algorithm for evaluating the availability of any given k-multidimensional vote and quorum assignments, where n is the number of sites in the system and k is the number of dimensions.