This letter proposes a heuristic algorithm to select check variables, which are points of comparison for error detection, for soft-error tolerant datapaths. Our soft-error tolerance scheme is based on check-and-retry computation and an efficient resource management named speculative resource sharing (SRS). Starting with the smallest set of check variables, the proposed algorithm repeats to add new check variable one by one incrementally and find the minimum latency solution among the series of generated solutions. During the process, each new check variable is selected so that the opportunity of SRS is enlarged. Experimental results show that improvements in latency are achieved compared with the choice of the smallest set of check variables.
Junghoon OH
Japan Advanced Institute of Science and Technology
Mineo KANEKO
Japan Advanced Institute of Science and Technology
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Junghoon OH, Mineo KANEKO, "Latency-Aware Selection of Check Variables for Soft-Error Tolerant Datapath Synthesis" in IEICE TRANSACTIONS on Fundamentals,
vol. E100-A, no. 7, pp. 1506-1510, July 2017, doi: 10.1587/transfun.E100.A.1506.
Abstract: This letter proposes a heuristic algorithm to select check variables, which are points of comparison for error detection, for soft-error tolerant datapaths. Our soft-error tolerance scheme is based on check-and-retry computation and an efficient resource management named speculative resource sharing (SRS). Starting with the smallest set of check variables, the proposed algorithm repeats to add new check variable one by one incrementally and find the minimum latency solution among the series of generated solutions. During the process, each new check variable is selected so that the opportunity of SRS is enlarged. Experimental results show that improvements in latency are achieved compared with the choice of the smallest set of check variables.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E100.A.1506/_p
Copy
@ARTICLE{e100-a_7_1506,
author={Junghoon OH, Mineo KANEKO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Latency-Aware Selection of Check Variables for Soft-Error Tolerant Datapath Synthesis},
year={2017},
volume={E100-A},
number={7},
pages={1506-1510},
abstract={This letter proposes a heuristic algorithm to select check variables, which are points of comparison for error detection, for soft-error tolerant datapaths. Our soft-error tolerance scheme is based on check-and-retry computation and an efficient resource management named speculative resource sharing (SRS). Starting with the smallest set of check variables, the proposed algorithm repeats to add new check variable one by one incrementally and find the minimum latency solution among the series of generated solutions. During the process, each new check variable is selected so that the opportunity of SRS is enlarged. Experimental results show that improvements in latency are achieved compared with the choice of the smallest set of check variables.},
keywords={},
doi={10.1587/transfun.E100.A.1506},
ISSN={1745-1337},
month={July},}
Copy
TY - JOUR
TI - Latency-Aware Selection of Check Variables for Soft-Error Tolerant Datapath Synthesis
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1506
EP - 1510
AU - Junghoon OH
AU - Mineo KANEKO
PY - 2017
DO - 10.1587/transfun.E100.A.1506
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E100-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 2017
AB - This letter proposes a heuristic algorithm to select check variables, which are points of comparison for error detection, for soft-error tolerant datapaths. Our soft-error tolerance scheme is based on check-and-retry computation and an efficient resource management named speculative resource sharing (SRS). Starting with the smallest set of check variables, the proposed algorithm repeats to add new check variable one by one incrementally and find the minimum latency solution among the series of generated solutions. During the process, each new check variable is selected so that the opportunity of SRS is enlarged. Experimental results show that improvements in latency are achieved compared with the choice of the smallest set of check variables.
ER -