Optimal algorithms for exact, inexact, and approval voting

The design of optimal n-way voting algorithms based on the structure of the input object space is considered. The design techniques are then extended to inexact and approval voting schemes. It is shown that efficient theta (n)-time voting algorithms can be designed when the input object space is small. Next in the hierarchy is the case of a totally-ordered object space that supports worst-case theta (nlogn) algorithms for both exact and inexact voting as well as for certain approval-voting schemes. An unordered input object space leads to worst-case Omega (n/sup 2/) algorithms, even when a distance metric can be defined on the input object space. Some observations on the relationship of voting to other well-studied problems, particularly sorting, are also included.<<ETX>>

[1]  Dave E. Eckhardt,et al.  A theoretical investigation of generalized voters for redundant systems , 1989, [1989] The Nineteenth International Symposium on Fault-Tolerant Computing. Digest of Papers.

[2]  Stephen Y. H. Su,et al.  Self-Diagnosis of Faelures in VLSI Tree Array Processors , 1991, IEEE Trans. Computers.

[3]  Hirokazu Ihara,et al.  Dependable onboard computer systems with a new method-stepwise negotiating voting , 1989, [1989] The Nineteenth International Symposium on Fault-Tolerant Computing. Digest of Papers.

[4]  Hector Garcia-Molina,et al.  The Reliability of Voting Mechanisms , 1987, IEEE Transactions on Computers.

[5]  Yinong Chen,et al.  Implementing fault-tolerance via modular redundancy with comparison , 1990 .

[6]  Joel R. Sklaroff,et al.  Redundancy Management Technique for Space Shuttle Computers , 1976, IBM J. Res. Dev..

[7]  Algirdas Avizienis,et al.  The N-Version Approach to Fault-Tolerant Software , 1985, IEEE Transactions on Software Engineering.

[8]  Sushil Jajodia,et al.  Dynamic voting algorithms for maintaining the consistency of a replicated database , 1990, TODS.

[9]  Hector Garcia-Molina,et al.  How to assign votes in a distributed system , 1985, JACM.

[10]  Prathima Agrawal,et al.  Fault Tolerance in Multiprocessor Systems without Dedicated Redundancy , 1988, IEEE Trans. Computers.

[11]  Douglas M. Blough,et al.  A comparison of voting strategies for fault-tolerant distributed systems , 1990, Proceedings Ninth Symposium on Reliable Distributed Systems.

[12]  Özalp Babaoglu,et al.  On the reliability of consensus-based fault-tolerant distributed computing systems , 1987, TOCS.

[13]  Nancy G. Leveson,et al.  An experimental evaluation of the assumption of independence in multiversion programming , 1986, IEEE Transactions on Software Engineering.

[14]  Udo Voges,et al.  Use of Diversity in Experimental Reactor Safety Systems , 1988 .

[15]  S S Brilliant,et al.  The consistent comparison problem in N-version software , 1987, SOEN.

[16]  B. Parhami.  Voting networks , 1991 .

[17]  D. R. K. Brownrigg,et al.  The weighted median filter , 1984, CACM.

[18]  D. Campbell,et al.  Finding a Majority When Sorting is Not Available , 1991, Comput. J..

[19]  David K. Gifford,et al.  Weighted voting for replicated data , 1979, SOSP '79.