FAC: A Fault-Tolerant Design Approach Based on Approximate Computing

被引:0
|
作者
Balasubramanian, Padmanabhan [1 ]
Maskell, Douglas L. [1 ]
机构
[1] Nanyang Technol Univ, Sch Comp Sci & Engn, 50 Nanyang Ave, Singapore 639798, Singapore
关键词
fault tolerance; triple modular redundancy; approximate computing; arithmetic circuits; digital logic design; low power; high-speed; CMOS; TRANSIENT FAULTS; CIRCUITS; LOGIC; ADDER; TMR;
D O I
10.3390/electronics12183819
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This article introduces a new fault-tolerant design approach based on approximate computing, called FAC, for designing redundant circuits and systems. Traditionally, triple modular redundancy (TMR) has been used to ensure complete tolerance to any single fault or a faulty processing unit, where the processing unit may be a circuit or a system. However, TMR incurs more than 200% overhead in terms of area and power compared to a single processing unit. Alternative redundancy approaches have been proposed in the literature to mitigate these overheads associated with TMR, but they provide only partial or moderate fault tolerance. Among the alternatives, majority voting-based reduced precision redundancy (MVRPR) may be useful for error-resilient applications such as digital signal processing. While MVRPR guarantees only moderate fault tolerance, the proposed FAC is well-suited for error-resilient applications and ensures 100% tolerance to any single fault or a faulty processing unit, like TMR. In this work, we evaluate the performance of TMR, MVRPR, and FAC for a digital image processing application. The image processing results obtained demonstrate the effectiveness of FAC. Moreover, when the processing unit is implemented using a 28-nm CMOS technology, FAC achieves significant improvements over TMR, including a 15.3% reduction in delay, a 19.5% reduction in area, and a 24.7% reduction in power. Compared to MVRPR, FAC exhibits notable enhancements, with an 18% reduction in delay, a 5.4% reduction in area, and an 11.2% reduction in power. When considering the power-delay product, which reflects energy efficiency, FAC demonstrates a 36.2% reduction compared to TMR and a 27.2% reduction compared to MVRPR. When considering the power-delay-area product, which represents design efficiency, FAC achieves a 48.7% reduction compared to TMR and a 31.1% reduction compared to MVRPR.
引用
收藏
页数:15
相关论文
共 50 条
  • [41] TECHNIQUES AND ARCHITECTURES FOR FAULT-TOLERANT COMPUTING
    MAXION, RA
    SIEWIOREK, DP
    ELKIND, SA
    ANNUAL REVIEW OF COMPUTER SCIENCE, 1987, 2 : 469 - 520
  • [42] Fault-Tolerant Neuromorphic Computing Systems
    Chaudhuri, Arjun
    Liu, Mengyun
    Chakrabarty, Krishnendu
    2019 IEEE INTERNATIONAL TEST CONFERENCE (ITC), 2019,
  • [43] FAULT-TOLERANT COMPUTING - CONCEPTS AND EXAMPLES
    RENNELS, DA
    IEEE TRANSACTIONS ON COMPUTERS, 1984, 33 (12) : 1116 - 1129
  • [44] Efficient fault-tolerant quantum computing
    Andrew M. Steane
    Nature, 1999, 399 : 124 - 126
  • [45] An Introduction into Fault-tolerant Quantum Computing
    Paler, Alexandru
    Devitt, Simon J.
    2015 52ND ACM/EDAC/IEEE DESIGN AUTOMATION CONFERENCE (DAC), 2015,
  • [46] Approximate Fault-Tolerant Neural Network Systems
    Traiola, Marcello
    Pappalardo, Salvatore
    Piri, Ali
    Ruospo, Annachiara
    Deveautour, Bastien
    Sanchez, Ernesto
    Bosio, Alberto
    Saeedi, Sepide
    Carpegna, Alessio
    Gogebakan, Aml Bayram
    Magliano, Enrico
    Savino, Alessandro
    IEEE EUROPEAN TEST SYMPOSIUM, ETS 2024, 2024,
  • [47] Fault-tolerant preparation of approximate GKP states
    Shi, Yunong
    Chamberland, Christopher
    Cross, Andrew
    NEW JOURNAL OF PHYSICS, 2019, 21 (09):
  • [48] A Fault-Tolerant Mobile Computing Model Based On Scalable Replica
    Sati, Meenakshi
    Vikash, Vivek
    Bijalwan, Vishwanath
    Kumari, Pinki
    Raj, Manish
    Balodhi, Meenu
    Gairola, Priya
    Semwal, Vijay Bhaskar
    INTERNATIONAL JOURNAL OF INTERACTIVE MULTIMEDIA AND ARTIFICIAL INTELLIGENCE, 2014, 2 (06): : 58 - 68
  • [49] A fault-tolerant tree-based fog computing model
    Oma, Ryuji
    Nakamura, Shigenari
    Duolikun, Dilawaer
    Enokido, Tomoya
    Takizawa, Makoto
    INTERNATIONAL JOURNAL OF WEB AND GRID SERVICES, 2019, 15 (03) : 219 - 239
  • [50] FAULT-TOLERANT PROGRAMMING FOR NETWORK-BASED PARALLEL COMPUTING
    CLEMATIS, A
    MICROPROCESSING AND MICROPROGRAMMING, 1994, 40 (10-12): : 765 - 768