Voting Algorithms

IEEE Transactions on Reliability

Volumn 43, Issue 4, 1994, Pages 617-629

  Parhami, Behrooz ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Approval voting; Computational complexity; Design diversity; Inexact voting; Majority voting; Multi channel computation; Multiversion software; N modular redundancy; Plurality voting; Threshold voting

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; HIERARCHICAL SYSTEMS; OPTIMAL SYSTEMS; REDUNDANCY; SORTING;

APPROVAL VOTING; INEXACT VOTING; PLURALITY VOTING; VOTING ALGORITHMS;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 0028741835     PISSN: 00189529     EISSN: 15581721     Source Type: Journal    
DOI: 10.1109/24.370218     Document Type: Article

References (56)

1. P. Agrawal, “Fault tolerance in multiprocessor systems without dedicated redundancy”, IEEE Trans. Computers, vol 37, 1988 Mar, pp 358–362.
2. P.E. Ammann, J.C. Knight, “Data diversity: An approach to software fault tolerance”, IEEE Trans. Computers, vol 37, 1988 Apr, pp 418–425.
3. A. Avizienis et al, “The STAR (self-testing-and-repairing) computer: An investigation of the theory and practice of faulttolerant computer design”, IEEE Trans. Computers, vol C-20, 1971 Nov, pp 1312–1321.
4. A. Avizienis, “The N-version approach to faulttolerant software”, IEEE Trans. Software Engineering, vol SE-11, 1985 Dec, pp 1491–1501.
5. O. Babaoglu, “On the reliability of consensus-based faulttolerant distributed computing systems‘’, ACM Trans. Computer Systems, vol 5, 1987 Nov, pp 394–416.
6. D. Barbara, H. Garcia-Molina, “The reliability of voting mechanisms”, IEEE Trans. Computers, vol C-36, 1987 Oct, pp 1197–1208.
7. D.M. Blough, G.F. Sullivan, “A comparison of voting strategies for faulttolerant distributed systems”, Proc. 9 Symp. Reliable Distributed Systems, 1990 Oct, pp 136–145.
8. D.M. Blough, G.F. Sullivan, “An analysis of the voting problem for faulttolerant systems”, unpublished manuscript, 1992.
9. R.S. Boyer, J.S. Moore, “MJRTY: A fast majority vote algorithm”, Automated Reasoning: Essays in Honor of Woody Bledsoe (R.S. Boyer, Ed), 1991; Kluwer.
10. S.S. Brilliant, J.C. Knight, N.G. Leveson, “The consistent comparison problem in N-version software”, Software Engineering Notes, ACM SIGSOFT, vol 12, 1987 Jan, pp 29–34.
11. D.R.K. Brownrigg, “The weighted median filter”, Commun. ACM, vol 27, 1984 Aug, pp 807–818.
12. D. Campbell, T. McNeill, “Finding a majority when sorting is not available”, The Computer J., vol 34, 1991 Apr, p 186.
13. L. Chen, A. Avizienis, “N-version programming: A fault tolerance approach to reliability of software operation”, Proc. Int? Symp. Faulttolerant Tolerant Computing, 1978 Jun, pp 3-9; Toulouse, France.
14. Y. Chen, T. Chen, “Implementing fault tolerance via modular redundancy with comparison”, IEEE Trans. Reliability, vol 39, 1990 Jun, pp 217–225.
15. F.N. David, D.E. Barton, Combinatorial Chance, 1962; p 315; Hafner.
16. P.T. DeSousa, F.P. Mathur, “Sift-out modular redundancy”, IEEE Trans. Computers, vol C-27, 1978 Jul, pp 624–627.
17. D. Dolev, L. Lamport, M. Pease, R. Shostak, “The Byzantine generals”, Concurrency Control and Reliability in Distributed Systems (BK. Bhargava, Ed), 1987, pp 348-369; Van Nostrand Reinhold.
18. H. Garcia-Molina, D. Barbara, “How to assign votes in a distributed system”, J. ACM, vol 32, 1985 Oct, pp 841–860.
19. D.K. Gifford, “Weighted voting for replicated data”, Proc. 7 th ACM SIGOPS Symp. Operating System Principles, 1979 Dec, pp 150-159; Pacific Grove, CA.
20. D. Gries, “A hands-in-the-pocket presentation of a k-majority vote algorithm”, Formal Development of Programs and Proofs (E.W. Di-jkstra, jkstra, Ed), 1990, pp 43-45; Addison-Wesley.
21. A.L. Hopkins, T.B. Smith, J.H. Lala, “FTMP: A highly reliable faulttolerant tolerant multiprocessor for aircraft”, Proc. IEEE, vol 66, 1978 Oct, pp 1221–1239.
22. S. Jajodia, D. Mutchler, “Dynamic voting algorithms for maintaining the consistency of a replicated database”, ACM Trans. Database Systems, vol 15, 1990 Jun, pp 230–280.
23. W. Johnson, Design and Analysis of Faulttolerant Digital Systems, 1989; Addison-Wesley.
24. N. Kanekawa, H. Maejima, H. Kato, H. Ihara, “Dependable onboard computer systems with a new method stepwise negotiating voting”, Proc. Int'l Symp. Faulttolerant Computing, 1989 Jun, pp 13-19; Chicago.
25. J.C. Knight, N.G. Leveson, “An experimental evaluation of the assumption of independence in Multiversion programming”, IEEE Trans. Software Engineering, vol SE-12, 1986 Jan, pp 96–109.
26. D.E. Knuth, The Art of Computer Programming vol 1: Fundamental Algorithms (2 nd ed), 1973, subsection 1.2.6, problem 64, pp 73 & 489; Addison-Wesley.
27. Z. Kohavi, Switching and Finite Automata Theory (2nd ed), 1978, pp 333-347; McGraw-Hill.
28. P.R. Lorczak, A.K. Caglayan, D.E. Eckhardt, “A theoretical investigation of generalized voters for redundant systems”, Proc. Intl Symp. Faulttolerant Tolerant Computing, 1989 Jun, pp 444-451; Chicago.
29. J. Losq, “A highly efficient redundancy scheme: Self-purging redundancy”, IEEE Trans. Computers, vol C-25, 1976 Jun, pp 569–578.
30. F.P. Mathur, A. Avizienis, “Reliability analysis and architecture of a hybrid-redundant digital system: Generalized triple modular redundancy with self-repair”, AFIPS Conf Proc, vol 36 (Spring Joint Computer Conf.), 1970, pp 375-383; AFIPS Press.
31. F.P. Mathur, P. DeSousa, “Reliability modeling and analysis of general modular redundant systems”, IEEE Trans. Reliability, vol R-24, 1975 Dec, pp 296–299.
32. D.F. McAllister, C.E. Sun, M.A. Vouk, “Reliability of voting in faulttolerant tolerant software with small output spaces”, IEEE Trans. Reliability, vol 39, 1990 Dec, pp 524–534.
33. J. Misra, D. Gries, “Finding repeated elements”, Science of Computer Programming, vol 2, 1982, pp 143–152. (See also correspondence in The Computer J., vol 35, 1992 Jun, p 298.)
34. L.E. Moser, V. Kapur, P.M. Melliar-Smith, “Probabilistic language analysis of weighted voting mechanisms”, Proc. ACM Sigmetrics Conf Measurement and Modeling of Computer Systems, 1990 May, pp 67–73.
35. B. Parhami, “Voting networks”, IEEE Trans. Reliability, vol 40, 1991 Aug, pp 380–394.
36. B. Parhami, “The parallel complexity of weighted voting”, Proc. Int ‘1 Symp. Parallel and Distributed Computing and Systems, 1991 Oct, pp 382-385; Washington, DC.
37. B. Parharni, “High-performance parallel pipelined voting networks”, Proc. Int‘l Parallel Processing Symp, 1991 Apr/May, pp 491-494; Anaheim, CA.
38. B. Parhami, “Design of m-out-of-n bit-voters”, Proc. 25th Asilomar Conf Signals, Systems, and Computers, 1991 Nov, pp 1260-1264; Pacific Grove, CA.
39. B. Parhami, “Optimal algorithms for exact, inexact, and approval voting”, Proc. Int'l Symp. Faulttolerant Computing, 1992 Jun, pp 444-451; Boston.
40. B. Parhami, C.Y. Hung, “Scheduling of replicated tasks to meet correctness requirements and deadlines”, Proc. 26 th Hawaii Intl Conf System Sciences, 1993 Jan, vol 2, pp 506–515.
41. J.F. Paris, “Voting with a variable number of copies”, Proc. Intl Symp. Faulttolerant Computing, 1986 Jul, pp 50-55; Vienna.
42. W.H. Pierce, “Adaptive decision elements to improve the reliability of redundant systems”, IRE Int'l Cony. Record, 1962 Mar, pp 124–131.
43. K.G. Shin, J.W. Dolter, “Alternative majority-voting methods for realtime computing”, IEEE Trans. Reliability, vol 38, 1989 Apr, pp 58–64.
44. D.P. Siewiorek, E.J. McCluskey, “Switch complexity in systems with hybrid redundancy”, IEEE Trans. Computers, vol C-22, 1973 Mar, pp 276–282.
45. D.P. Siewiorek, E.J. McCluskey, “An iterative cell switch design for hybrid redundancy”, IEEE Trans. Computers, vol C-22, 1973 Mar, pp 290–297.
46. D.P. Siewiorek, “Reliability modeling of compensating module failures in majority voted redundancy”, IEEE Trans. Computers, vol C-24, 1975 May, pp 525–533.
47. D.P. Siewiorek et al, “C.vmp: A voted multiprocessor”, Proc. IEEE, vol 66, 1978 Oct, pp 1190–1198.
48. D.P. Siewiorek, R.S. Swats, Reliable Computer Systems: Design and Evaluation (2 nd ed), 1992, pp 138–146 (Discussion on voting); Digital Press.
49. J.R. Sklaroff, “Redundancy management techniques for space shuttle computers”, IBM J. Research and Development, vol 20, 1976 Jan, pp 20–28.
50. S.Y.H. Su, M. Cutler, M. Wang, “Self-diagnosis of failures in VLSI tree array processors”, IEEE Trans. Computers, vol 40, 1991 Nov, pp 1252–1257.
51. Z. Tong, R. Y. Kain, “Vote assignments in weighted voting mechanisms”, IEEE Trans. Computers, vol 40, 1991 May, pp 664–667.
52. U. Voges, “Use of diversity in experimental reactor safety systems”, Software Diversity in Computerized Control Systems, 1988, pp 29-49; Springer-Verlag.
53. J. von Neumann, “Probabilistic logics and the synthesis of reliable organisms from unreliable components”, Automata Studies (Annals of Mathematics Studies, num 34), (CE. Shannon, J. McCarthy, Eds), 1956, pp 43-98; Princeton Univ. Press.
54. S. Waser, M.J. Flynn, Introduction to Arithmetic for Digital System Designers, 1982; Holt, Rinehart, & Winston.
55. J.H. Wensley, et al, “SIFT: Design and analysis of a faulttolerant computer for aircraft control”, Proc. IEEE, vol 66, 1978 Oct, pp 1240–1255.
56. J.H. Wensley C.S. Harclerode, “Programmable control of a chemical reactor using a fault tolerant computer”, IEEE Trans. Industrial Electronics, vol IE-29, 1982 Nov, pp 258–264.