Use of approximate triple modular redundancy for fault tolerance in digital circuits
Autor(a) principal: | |
---|---|
Data de Publicação: | 2018 |
Tipo de documento: | Tese |
Idioma: | eng |
Título da fonte: | Biblioteca Digital de Teses e Dissertações da UFRGS |
Texto Completo: | http://hdl.handle.net/10183/193344 |
Resumo: | Triple Modular Redundancy (TMR) is a well-known mitigation technique, which provides a full masking capability to single faults, although at a great cost in terms of area and power consumption. For that reason, partial redundancy is often applied instead to alleviate these overheads. In this context, Approximate TMR, which is the implementation of TMR with approximate versions of the target circuit, has emerged in recent years as an alternative to partial replication, with the advantage of optimizing the trade-off between error coverage and area overhead. Several techniques for approximate circuit generation already exist in the literature, each one with its pros and con. This work do further study of the ATMR technique that evaluating the cost-benefit between area increase and coverage of approach failures. The first contribution is a new idea for the approximate-TMR approach where all of the redundant modules are approximate version of the original design, therefore allowing the creating o ATMR circuits with very low area overhead, we named this technique as Full-ATMR or just FATMR. The work also presents a novel approach for implementing approximate ATMR, in a automatic way, that combines an approximate gate library (ApxLib) with a Multi-Objective Optimization Genetic Algorithm (MOOGA). The algorithm performs a blind search, over the huge solution space, optimizing error coverage and area overhead altogether. Experiments compare our approach with a state of the art technique showing an improvement of trade-offs for different benchmark circuits. The last contribution is another novel approach to design ATMR circuits, it combines the idea of approximate library and heuristic. The approach uses testability and observability techniques in order to take decision on how to best approximate a circuit. |
id |
URGS_d1d593e4632b4d01aa85188170403841 |
---|---|
oai_identifier_str |
oai:www.lume.ufrgs.br:10183/193344 |
network_acronym_str |
URGS |
network_name_str |
Biblioteca Digital de Teses e Dissertações da UFRGS |
repository_id_str |
1853 |
spelling |
Gomes, Iuri Albandes CunhaKastensmidt, Fernanda Gusmão de LimaAsensi, Sergio Antonio Cuenca2019-04-24T02:34:13Z2018http://hdl.handle.net/10183/193344001092238Triple Modular Redundancy (TMR) is a well-known mitigation technique, which provides a full masking capability to single faults, although at a great cost in terms of area and power consumption. For that reason, partial redundancy is often applied instead to alleviate these overheads. In this context, Approximate TMR, which is the implementation of TMR with approximate versions of the target circuit, has emerged in recent years as an alternative to partial replication, with the advantage of optimizing the trade-off between error coverage and area overhead. Several techniques for approximate circuit generation already exist in the literature, each one with its pros and con. This work do further study of the ATMR technique that evaluating the cost-benefit between area increase and coverage of approach failures. The first contribution is a new idea for the approximate-TMR approach where all of the redundant modules are approximate version of the original design, therefore allowing the creating o ATMR circuits with very low area overhead, we named this technique as Full-ATMR or just FATMR. The work also presents a novel approach for implementing approximate ATMR, in a automatic way, that combines an approximate gate library (ApxLib) with a Multi-Objective Optimization Genetic Algorithm (MOOGA). The algorithm performs a blind search, over the huge solution space, optimizing error coverage and area overhead altogether. Experiments compare our approach with a state of the art technique showing an improvement of trade-offs for different benchmark circuits. The last contribution is another novel approach to design ATMR circuits, it combines the idea of approximate library and heuristic. The approach uses testability and observability techniques in order to take decision on how to best approximate a circuit.application/pdfengMicroeletrônicaTolerancia : FalhasAlgoritmos genéticosApproximate CircuitsApproximate-TMRFault ToleranceSingle Event EffectsUse of approximate triple modular redundancy for fault tolerance in digital circuitsUso de redundancia modular tripla aproximada para tolerancia a falhas em circuitos digitais info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/doctoralThesisUniversidade Federal do Rio Grande do SulInstituto de InformáticaPrograma de Pós-Graduação em MicroeletrônicaPorto Alegre, BR-RS2018doutoradoinfo:eu-repo/semantics/openAccessreponame:Biblioteca Digital de Teses e Dissertações da UFRGSinstname:Universidade Federal do Rio Grande do Sul (UFRGS)instacron:UFRGSTEXT001092238.pdf.txt001092238.pdf.txtExtracted Texttext/plain207459http://www.lume.ufrgs.br/bitstream/10183/193344/2/001092238.pdf.txt8874eeb013d292f79a2ca027c3ab0192MD52ORIGINAL001092238.pdfTexto completo (inglês)application/pdf5654333http://www.lume.ufrgs.br/bitstream/10183/193344/1/001092238.pdfebe1878f70a1a8469863089bfb6a2c6fMD5110183/1933442022-02-22 05:03:17.30652oai:www.lume.ufrgs.br:10183/193344Biblioteca Digital de Teses e Dissertaçõeshttps://lume.ufrgs.br/handle/10183/2PUBhttps://lume.ufrgs.br/oai/requestlume@ufrgs.br||lume@ufrgs.bropendoar:18532022-02-22T08:03:17Biblioteca Digital de Teses e Dissertações da UFRGS - Universidade Federal do Rio Grande do Sul (UFRGS)false |
dc.title.pt_BR.fl_str_mv |
Use of approximate triple modular redundancy for fault tolerance in digital circuits |
dc.title.alternative.pt.fl_str_mv |
Uso de redundancia modular tripla aproximada para tolerancia a falhas em circuitos digitais |
title |
Use of approximate triple modular redundancy for fault tolerance in digital circuits |
spellingShingle |
Use of approximate triple modular redundancy for fault tolerance in digital circuits Gomes, Iuri Albandes Cunha Microeletrônica Tolerancia : Falhas Algoritmos genéticos Approximate Circuits Approximate-TMR Fault Tolerance Single Event Effects |
title_short |
Use of approximate triple modular redundancy for fault tolerance in digital circuits |
title_full |
Use of approximate triple modular redundancy for fault tolerance in digital circuits |
title_fullStr |
Use of approximate triple modular redundancy for fault tolerance in digital circuits |
title_full_unstemmed |
Use of approximate triple modular redundancy for fault tolerance in digital circuits |
title_sort |
Use of approximate triple modular redundancy for fault tolerance in digital circuits |
author |
Gomes, Iuri Albandes Cunha |
author_facet |
Gomes, Iuri Albandes Cunha |
author_role |
author |
dc.contributor.author.fl_str_mv |
Gomes, Iuri Albandes Cunha |
dc.contributor.advisor1.fl_str_mv |
Kastensmidt, Fernanda Gusmão de Lima Asensi, Sergio Antonio Cuenca |
contributor_str_mv |
Kastensmidt, Fernanda Gusmão de Lima Asensi, Sergio Antonio Cuenca |
dc.subject.por.fl_str_mv |
Microeletrônica Tolerancia : Falhas Algoritmos genéticos |
topic |
Microeletrônica Tolerancia : Falhas Algoritmos genéticos Approximate Circuits Approximate-TMR Fault Tolerance Single Event Effects |
dc.subject.eng.fl_str_mv |
Approximate Circuits Approximate-TMR Fault Tolerance Single Event Effects |
description |
Triple Modular Redundancy (TMR) is a well-known mitigation technique, which provides a full masking capability to single faults, although at a great cost in terms of area and power consumption. For that reason, partial redundancy is often applied instead to alleviate these overheads. In this context, Approximate TMR, which is the implementation of TMR with approximate versions of the target circuit, has emerged in recent years as an alternative to partial replication, with the advantage of optimizing the trade-off between error coverage and area overhead. Several techniques for approximate circuit generation already exist in the literature, each one with its pros and con. This work do further study of the ATMR technique that evaluating the cost-benefit between area increase and coverage of approach failures. The first contribution is a new idea for the approximate-TMR approach where all of the redundant modules are approximate version of the original design, therefore allowing the creating o ATMR circuits with very low area overhead, we named this technique as Full-ATMR or just FATMR. The work also presents a novel approach for implementing approximate ATMR, in a automatic way, that combines an approximate gate library (ApxLib) with a Multi-Objective Optimization Genetic Algorithm (MOOGA). The algorithm performs a blind search, over the huge solution space, optimizing error coverage and area overhead altogether. Experiments compare our approach with a state of the art technique showing an improvement of trade-offs for different benchmark circuits. The last contribution is another novel approach to design ATMR circuits, it combines the idea of approximate library and heuristic. The approach uses testability and observability techniques in order to take decision on how to best approximate a circuit. |
publishDate |
2018 |
dc.date.issued.fl_str_mv |
2018 |
dc.date.accessioned.fl_str_mv |
2019-04-24T02:34:13Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/doctoralThesis |
format |
doctoralThesis |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/10183/193344 |
dc.identifier.nrb.pt_BR.fl_str_mv |
001092238 |
url |
http://hdl.handle.net/10183/193344 |
identifier_str_mv |
001092238 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.source.none.fl_str_mv |
reponame:Biblioteca Digital de Teses e Dissertações da UFRGS instname:Universidade Federal do Rio Grande do Sul (UFRGS) instacron:UFRGS |
instname_str |
Universidade Federal do Rio Grande do Sul (UFRGS) |
instacron_str |
UFRGS |
institution |
UFRGS |
reponame_str |
Biblioteca Digital de Teses e Dissertações da UFRGS |
collection |
Biblioteca Digital de Teses e Dissertações da UFRGS |
bitstream.url.fl_str_mv |
http://www.lume.ufrgs.br/bitstream/10183/193344/2/001092238.pdf.txt http://www.lume.ufrgs.br/bitstream/10183/193344/1/001092238.pdf |
bitstream.checksum.fl_str_mv |
8874eeb013d292f79a2ca027c3ab0192 ebe1878f70a1a8469863089bfb6a2c6f |
bitstream.checksumAlgorithm.fl_str_mv |
MD5 MD5 |
repository.name.fl_str_mv |
Biblioteca Digital de Teses e Dissertações da UFRGS - Universidade Federal do Rio Grande do Sul (UFRGS) |
repository.mail.fl_str_mv |
lume@ufrgs.br||lume@ufrgs.br |
_version_ |
1810085475318235136 |