Distributed interval voting with node failures of various types

Proceedings - 21st International Parallel and Distributed Processing Symposium, IPDPS 2007; Abstracts and CD-ROM

Volumn , Issue , 2007, Pages

  Parhami, Behrooz ^a  

^a University of California   (United States)

Author keywords

Approval voting; Benign failure; Byzantine failure; Consensus; Data fusion; Dependable computing; Distributed computer system; Fault tolerance; Majority; Multichannel computation; Plurality; Uncertainty

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA FUSION; FAILURE ANALYSIS; FAULT TOLERANCE; FAULT TOLERANT COMPUTER SYSTEMS; UNCERTAINTY ANALYSIS;

APPROVAL VOTING; BENIGN FAILURE; BYZANTINE FAILURE; CONSENSUS; DEPENDABLE COMPUTING; MULTICHANNEL COMPUTATION; PLURALITY;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 34548756882     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2007.370607     Document Type: Conference Paper

References (24)

1. Alos-Ferrer, C., "A Simple Characterization of Approval Voting," Social Choice and Welfare, Vol. 27, pp. 621-625, 2006.
2. Barborak, M., and M. Malek, "The Consensus Problem in Fault-Tolerant Computing," ACM Computing Surveys, Vol. 25, No. 2, pp. ,June 1993.
3. Brams, S. J., and P. C. Fishburn, "Approval Voting," American Political Science Review, Vol. 72, pp. 831-847, 1978.
4. Brams, S. J., and P. C. Fishburn, "Yes-No Voting," Social Choice and Welfare, Vol. 10, pp. 35-50, 1993.
5. Castro, M., and B. Liskov, "Practical Byzantine Fault Tolerance and Proactive Recovery," ACM Trans. Computer Systems, Vol. 20, No. 4, pp. 398-461, November 2002.
6. Dasgupta, P. and E. Maskin, "The Fairest Vote of All," Scientific American, Vol. 290, pp. 92-97, March 2004.
7. Hodge, J. K., and R. E. Klima, The Mathematics of Voting and Elections: A Hands-on Approach, American Mathematical Society, 2005.
8. rd IFAC Symp. Mechatronic Systems, September 2004, pp. 639-644.
9. Krol, T., "Interactive Consistency Algorithms Based on Voting and Error-Correcting Codes," Proc. 25th Int'l Symp. Fault-Tolerant Computing, 1995, pp. 89-98.
10. Lamport, L., R. Shostak, and M. Pease, "The Byzantine Generals Problem," ACM Trans. Programming Languages and Systems, Vol. 4, No. 3, pp. 382-401, July 1982.
11. Lamport, L., "The Weak Byzantine Generals Problem." J. ACM, Vol. 30, No. 3, pp. 668-676, July 1983.
12. Latif-Shabgahi, G., Julian M. Bass, and Stuart Bennett, "A Taxonomy for Software Voting Algorithms Used in Safety-Critical Systems," IEEE Trans. Reliability, Vol. 53, No. 3, pp. 319-328, September 2004.
13. Levitin, G., "Weighted Voting Systems: Reliability versus Rapidity," Reliability Engineering & System Safety, Vol. 89, pp. 177-184, 2005.
14. Lorczak, P. R., A. K. Caglayan, and D. E. Eckhardt, "A Theoretical Investigation Generalized Voters for Redundant Systems," Proc. International Symp. Fault-Tolerant Computing, 1989, pp. 444-451.
15. Masso, J., and M. Vorsatz, "Weighted Approval Voting," Unpublished manuscript, version of September 4, 2006.
16. Meyer, F.J. and D.K. Pradhan, "Consensus with Dual Failure Modes," IEEE Trans. Parallel and Distributed Systems, Vol. 2. No. 2, pp. 214-222, April 1991.
17. Parhami, B., "Threshold Voting is Fundamentally Simpler than Plurality Voting," International Journal of Reliability, Quality, and Safety Engineering, Vol. 1, No. 1, pp. 95-102, March 1994.
18. Parhami, B., "Voting Algorithms," IEEE Trans. Reliability, Vol. 43, No. 4, pp. 617-629, December 1994.
19. Parhami, B., "A Taxonomy of Voting Schemes for Dependable Multi-Channel Computations," Reliability Engineering and System Safety, Vol. 52, pp. 139-151, May 1996.
20. Parhami, B., "Voting: A Paradigm for Adjudication and Data Fusion in Dependable Systems," in Dependable Computing Systems: Paradigms, Performance Issues, & Applications, ed. by H.B. Diab and A.Y. Zomaya, Wiley, 2005, pp. 87-114.
21. Pawlak, Z., J. Grzymala-Busse, R. Slowinski, and W. Ziarko, "Rough Sets." Communications of the ACM. Vol. 38, No. 11, pp. 89-95, November 1995.
22. M. Pease, R. Shostak, and L. Lamport, "Reaching Agreement in the Presence of Faults" J. ACM, Vol. 27, No. 2, pp. 228, 1980.
23. Saari, D. G., Chaotic Elections: A Mathematician Looks at Voting, American Mathematical Society, 2001.
24. von Neumann, J., "Probabilistic Logics and the Synthesis of Reliable Organisms from Unreliable Components," in Automata Studies (Annals of Mathematics Studies, No. 34), Ed. by C.E. Shannon and J. McCarthy, Princeton Univ. Press, pp. 43-98, 1956.