Cost-Effective Error Detection Through Mersenne Modulo Shadow Datapaths

Keith Campbell, Chen Hsuan Lin, Deming Chen

Research output: Contribution to journalArticle

Abstract

With technology scaling leading to reliability problems and a proliferation of hardware accelerators, there is a need for cost-effective techniques to detect errors in complex datapaths. Modulo (residue) arithmetic is useful for creating a shadow datapath to check the computation of an arithmetic datapath and involves three key steps: 1) reduction of the inputs to modulo shadow values; 2) computation with those shadow values; and 3) checking the outputs for consistency with the shadow outputs. The focus of this paper is new gate-level architectures and algorithms to reduce the cost of modulo shadow datapaths. We introduce new low-cost architectures for the functional units performing the aforementioned reduction, shadow computation, and checking operations. We compare our functional units to the previous state-of-the-art approach, observing a 12.5% reduction in area and a 47.1% reduction in delay for a 32-bit mod-3 reducer; that our reducer costs, which tend to dominate shadow datapath costs, do not increase with larger modulo bases; and that for modulo-15 and above, all of our functional units have better area and delay than their previous counterparts. To demonstrate the cost-effectiveness of our approach in computation-intensive accelerator applications, we design custom pipelined shadow datapaths for five compound functional units implementing a variety of vector and matrix operations. For a 32-bit main datapath and 2-bit shadow datapath, we observe area costs of 6%-10% and reliability improvements against single event transient errors of 3-61 $\times$. For an 8-bit shadow datapath, we observe area costs of 15%-20% and reliability gains of 121-2477 $\times$.

Original languageEnglish (US)
Article number8356040
Pages (from-to)1056-1069
Number of pages14
JournalIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Volume38
Issue number6
DOIs
StatePublished - Jun 2019

Fingerprint

Error detection
Costs
Particle accelerators
Cost effectiveness
Hardware

Keywords

  • Cost-effective
  • Mersenne number
  • error detection
  • functional unit
  • gate-level
  • modulo arithmetic
  • reliability
  • shadow datapath

ASJC Scopus subject areas

  • Software
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering

Cite this

Cost-Effective Error Detection Through Mersenne Modulo Shadow Datapaths. / Campbell, Keith; Lin, Chen Hsuan; Chen, Deming.

In: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 38, No. 6, 8356040, 06.2019, p. 1056-1069.

Research output: Contribution to journalArticle

@article{77accf1a74f24605ad21d89b0b79b29f,
title = "Cost-Effective Error Detection Through Mersenne Modulo Shadow Datapaths",
abstract = "With technology scaling leading to reliability problems and a proliferation of hardware accelerators, there is a need for cost-effective techniques to detect errors in complex datapaths. Modulo (residue) arithmetic is useful for creating a shadow datapath to check the computation of an arithmetic datapath and involves three key steps: 1) reduction of the inputs to modulo shadow values; 2) computation with those shadow values; and 3) checking the outputs for consistency with the shadow outputs. The focus of this paper is new gate-level architectures and algorithms to reduce the cost of modulo shadow datapaths. We introduce new low-cost architectures for the functional units performing the aforementioned reduction, shadow computation, and checking operations. We compare our functional units to the previous state-of-the-art approach, observing a 12.5{\%} reduction in area and a 47.1{\%} reduction in delay for a 32-bit mod-3 reducer; that our reducer costs, which tend to dominate shadow datapath costs, do not increase with larger modulo bases; and that for modulo-15 and above, all of our functional units have better area and delay than their previous counterparts. To demonstrate the cost-effectiveness of our approach in computation-intensive accelerator applications, we design custom pipelined shadow datapaths for five compound functional units implementing a variety of vector and matrix operations. For a 32-bit main datapath and 2-bit shadow datapath, we observe area costs of 6{\%}-10{\%} and reliability improvements against single event transient errors of 3-61 $\times$. For an 8-bit shadow datapath, we observe area costs of 15{\%}-20{\%} and reliability gains of 121-2477 $\times$.",
keywords = "Cost-effective, Mersenne number, error detection, functional unit, gate-level, modulo arithmetic, reliability, shadow datapath",
author = "Keith Campbell and Lin, {Chen Hsuan} and Deming Chen",
year = "2019",
month = "6",
doi = "10.1109/TCAD.2018.2834417",
language = "English (US)",
volume = "38",
pages = "1056--1069",
journal = "IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems",
issn = "0278-0070",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - Cost-Effective Error Detection Through Mersenne Modulo Shadow Datapaths

AU - Campbell, Keith

AU - Lin, Chen Hsuan

AU - Chen, Deming

PY - 2019/6

Y1 - 2019/6

N2 - With technology scaling leading to reliability problems and a proliferation of hardware accelerators, there is a need for cost-effective techniques to detect errors in complex datapaths. Modulo (residue) arithmetic is useful for creating a shadow datapath to check the computation of an arithmetic datapath and involves three key steps: 1) reduction of the inputs to modulo shadow values; 2) computation with those shadow values; and 3) checking the outputs for consistency with the shadow outputs. The focus of this paper is new gate-level architectures and algorithms to reduce the cost of modulo shadow datapaths. We introduce new low-cost architectures for the functional units performing the aforementioned reduction, shadow computation, and checking operations. We compare our functional units to the previous state-of-the-art approach, observing a 12.5% reduction in area and a 47.1% reduction in delay for a 32-bit mod-3 reducer; that our reducer costs, which tend to dominate shadow datapath costs, do not increase with larger modulo bases; and that for modulo-15 and above, all of our functional units have better area and delay than their previous counterparts. To demonstrate the cost-effectiveness of our approach in computation-intensive accelerator applications, we design custom pipelined shadow datapaths for five compound functional units implementing a variety of vector and matrix operations. For a 32-bit main datapath and 2-bit shadow datapath, we observe area costs of 6%-10% and reliability improvements against single event transient errors of 3-61 $\times$. For an 8-bit shadow datapath, we observe area costs of 15%-20% and reliability gains of 121-2477 $\times$.

AB - With technology scaling leading to reliability problems and a proliferation of hardware accelerators, there is a need for cost-effective techniques to detect errors in complex datapaths. Modulo (residue) arithmetic is useful for creating a shadow datapath to check the computation of an arithmetic datapath and involves three key steps: 1) reduction of the inputs to modulo shadow values; 2) computation with those shadow values; and 3) checking the outputs for consistency with the shadow outputs. The focus of this paper is new gate-level architectures and algorithms to reduce the cost of modulo shadow datapaths. We introduce new low-cost architectures for the functional units performing the aforementioned reduction, shadow computation, and checking operations. We compare our functional units to the previous state-of-the-art approach, observing a 12.5% reduction in area and a 47.1% reduction in delay for a 32-bit mod-3 reducer; that our reducer costs, which tend to dominate shadow datapath costs, do not increase with larger modulo bases; and that for modulo-15 and above, all of our functional units have better area and delay than their previous counterparts. To demonstrate the cost-effectiveness of our approach in computation-intensive accelerator applications, we design custom pipelined shadow datapaths for five compound functional units implementing a variety of vector and matrix operations. For a 32-bit main datapath and 2-bit shadow datapath, we observe area costs of 6%-10% and reliability improvements against single event transient errors of 3-61 $\times$. For an 8-bit shadow datapath, we observe area costs of 15%-20% and reliability gains of 121-2477 $\times$.

KW - Cost-effective

KW - Mersenne number

KW - error detection

KW - functional unit

KW - gate-level

KW - modulo arithmetic

KW - reliability

KW - shadow datapath

UR - http://www.scopus.com/inward/record.url?scp=85046703701&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85046703701&partnerID=8YFLogxK

U2 - 10.1109/TCAD.2018.2834417

DO - 10.1109/TCAD.2018.2834417

M3 - Article

AN - SCOPUS:85046703701

VL - 38

SP - 1056

EP - 1069

JO - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

JF - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

SN - 0278-0070

IS - 6

M1 - 8356040

ER -