An approximate voting scheme for reliable computing
Authors: 
Ke Chen, Fabrizio Lombardi, Jie HanAuthors Info & Claims
Ke Chen, Fabrizio Lombardi, Jie HanAuthors Info & ClaimsPages 293 - 296
Abstract
This paper relies on the principles of inexact computing to alleviate the issues arising in static masking by voting for reliable computing. A scheme that utilizes approximate voting is proposed; it is referred to as inexact double modular redundancy (IDMR). IDMR does not resort to triplication, thus saving overhead due to modular replication; moreover, this scheme is adaptive in its operation, i.e., it allows a threshold to determine the validity of the module outputs. IDMR operates by initially establishing the difference between the values of the outputs of the two modules; only if the difference is below a preset threshold, then the voter calculates the average value of the two module outputs. An extensive analysis of the voting circuits and an application to image processing are presented.
References
[1]
R. Baumann, "Soft errors in advanced computer systems," IEEE Design and Test of Computers., vol. 22, no. 3, pp. 258--266, May--Jun. 2005.
[2]
J. von Neumann, "Probabilistic Logics and the Synthesis of Reliable Organisms from Unreliable Components," Automata Studies, Ann. Of Math. Studies, no. 34, C. E. Shannon and J. McCarthy, Eds., Princeton University Press, pp. 43--98, 1956.
[3]
N. Vaidya and D. Pradhan, "Fault-Tolerant Design Strategies for High Reliability and Safety," IEEE Trans. On Computer, vol. 42, no. 10, pp. 1195--1206, Oct. 1993.
[4]
J. Han, J. Gao, Y. Qi, P. Jonker, J. Fortes, "Toward hardware-redundant, fault-tolerant logic for nanoelectronics," IEEE Design and Test of Computers, vol. 22, no. 4, pp. 328--339, July--August 2005.
[5]
W. H. Pierce, Failure-Tolerant Computer Design, Academic Press, 1965.
[6]
J. Han and M. Orshansky, "Approximate Computing: An Emerging Paradigm for Energy-Efficient Design," in ETS'13, pp. 1--6, 2013.
[7]
J. Liang, J. Han, and F. Lombardi, "New metrics for the reliability of approximate and probabilistic adders," IEEE Transactions on Computers, vol. 62, no. 9, pp. 1760--1771, 2013.
[8]
P. Reviriego, C. J. Bleakley, J. A. Maestro, "Diverse Double Modular Redundancy: A New Direction for Soft-Error Detection and Correction," IEEE Design & Test, vol. 30, no. 2, pp. 87--95, April 2013.
[9]
P. Reviriego, C. Bleakley, and J. A. Maestro, "Structural DMR: A technique for implementation of soft error tolerant FIR filters," IEEE Trans. Circuits Syst. II, vol. 58, no. 8, pp. 512--516, Aug. 2011.
[10]
S. Mitra, E. J. McCluskey, "Word-voter: a new voter design for triple modular redundant systems," Proc. 18th IEEE VLSI Test Symposium, pp. 465--470, 2000.
[11]
S. R. Chowdhury, A. Banerjee, A. Roy, H. Saha, "A high speed 8 transistor full adder design using novel 3 transistor XOR gates," World Academy of Sciences, vol. 22, 2008.
[12]
A. Rubio, J. F. Pàmies, E. Vatajelu, R. C. Corretger, "Process variability in sub-16nm bulk CMOS technology," Project: Terascale Reliable Adaptive Memory Systems, FP7-INFSO--IST -248789, 2012.
Index Terms
- An approximate voting scheme for reliable computing
Recommendations
An Experiment in Approval Voting
The first major experimental comparison of approval voting with regular plurality voting occurred in the 1985 annual election of The Institute of Management Sciences TIMS. In approval voting a person votes for approves of as many candidates as desired, ...
Control complexity in fallback voting
CATS '10: Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109We study the control complexity of fallback voting. Like manipulation and bribery, electoral control describes ways of changing the outcome of an election; unlike manipulation or bribery attempts, control actions---such as adding/deleting/partitioning ...
Comments
Information & Contributors
Information
Published In
Sponsors
- EDAA: European Design Automation Association
- ECSI
- EDAC: Electronic Design Automation Consortium
- SIGDA: ACM Special Interest Group on Design Automation
- Russian Acadamy of Sciences: Russian Acadamy of Sciences
- IEEE Council on Electronic Design Automation (CEDA)
Publisher
EDA Consortium
San Jose, CA, United States
Publication History
Published: 09 March 2015
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
DATE '15
Sponsor:
- EDAA
- EDAC
- SIGDA
- Russian Acadamy of Sciences
Acceptance Rates
DATE '15 Paper Acceptance Rate 206 of 915 submissions, 23%;
Overall Acceptance Rate 518 of 1,794 submissions, 29%
Upcoming Conference
DATE '25
- Sponsor:
- sigda
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 63Total Downloads
- Downloads (Last 12 months)3
- Downloads (Last 6 weeks)1
Reflects downloads up to 29 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in