Fully Adaptive Stochastic Handling of Soft-Errors in Real-Time Systems

In the design of real-time systems, it is becoming increasingly important to take soft-error tolerance into account. While hardening techniques such as error detection and error correction enable us to build systems that can better tolerate soft-errors, they are inevitably accompanied with execution...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Hyung-Chan An, Hoeseok Yang
Formato:	article
Lenguaje:	EN
Publicado:	IEEE 2021
Materias:	Optimization real-time systems processor scheduling software reliability fault tolerance Electrical engineering. Electronics. Nuclear engineering TK1-9971
Acceso en línea:	https://doaj.org/article/713e9d9464e4437285936dc3564f47cf
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:713e9d9464e4437285936dc3564f47cf
record_format	dspace
spelling	oai:doaj.org-article:713e9d9464e4437285936dc3564f47cf2021-11-26T00:01:54ZFully Adaptive Stochastic Handling of Soft-Errors in Real-Time Systems2169-353610.1109/ACCESS.2021.3128397https://doaj.org/article/713e9d9464e4437285936dc3564f47cf2021-01-01T00:00:00Zhttps://ieeexplore.ieee.org/document/9615233/https://doaj.org/toc/2169-3536In the design of real-time systems, it is becoming increasingly important to take soft-error tolerance into account. While hardening techniques such as error detection and error correction enable us to build systems that can better tolerate soft-errors, they are inevitably accompanied with execution time overhead. In order to mitigate the impact of the increased execution time, Chen <italic>et al.</italic> proposed to identify the <inline-formula> <tex-math notation="LaTeX">$(m,k)$ </tex-math></inline-formula><italic>-constraints</italic> of real-time tasks, which demand that at least <inline-formula> <tex-math notation="LaTeX">$m$ </tex-math></inline-formula> jobs out of <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> consecutive task invocations must be fault-free, and to design hardening policies based on this constraint. In this paper, we propose a new method to design hardening policies that are <italic>adaptive</italic> and <italic>stochastic</italic>. At the heart of our method is a new linear program (LP) formulation that finds an adaptive stochastic policy optimizing the CPU utilization. At the design time, we first identify the task set information of a given system, verify the system schedulability, and solve LPs to find an optimal policy. This policy is represented as a look-up table that specifies the stochastic hardening decisions as a function of the past execution history of the system. At the run time, hardening decisions are made simply by looking up this table. The proposed method finds hardening policies that adaptively reacts to the execution history of the system, allowing improvement in the CPU utilization. The method also deviates from the previous approaches’ viewpoint that reliability must be assessed in an all-or-nothing manner, by devising the notion of stochastic hardening policies. We evaluated the effectiveness of the proposed method using various task sets. In a set of 2,050 benchmarks, the system’s CPU utilization was improved by 2.80%-7.16% on average under different configurations. The improvement was by as high as 18.45% in the best benchmark.Hyung-Chan AnHoeseok YangIEEEarticleOptimizationreal-time systemsprocessor schedulingsoftware reliabilityfault toleranceElectrical engineering. Electronics. Nuclear engineeringTK1-9971ENIEEE Access, Vol 9, Pp 155058-155071 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	Optimization real-time systems processor scheduling software reliability fault tolerance Electrical engineering. Electronics. Nuclear engineering TK1-9971
spellingShingle	Optimization real-time systems processor scheduling software reliability fault tolerance Electrical engineering. Electronics. Nuclear engineering TK1-9971 Hyung-Chan An Hoeseok Yang Fully Adaptive Stochastic Handling of Soft-Errors in Real-Time Systems
description	In the design of real-time systems, it is becoming increasingly important to take soft-error tolerance into account. While hardening techniques such as error detection and error correction enable us to build systems that can better tolerate soft-errors, they are inevitably accompanied with execution time overhead. In order to mitigate the impact of the increased execution time, Chen <italic>et al.</italic> proposed to identify the <inline-formula> <tex-math notation="LaTeX">$(m,k)$ </tex-math></inline-formula><italic>-constraints</italic> of real-time tasks, which demand that at least <inline-formula> <tex-math notation="LaTeX">$m$ </tex-math></inline-formula> jobs out of <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> consecutive task invocations must be fault-free, and to design hardening policies based on this constraint. In this paper, we propose a new method to design hardening policies that are <italic>adaptive</italic> and <italic>stochastic</italic>. At the heart of our method is a new linear program (LP) formulation that finds an adaptive stochastic policy optimizing the CPU utilization. At the design time, we first identify the task set information of a given system, verify the system schedulability, and solve LPs to find an optimal policy. This policy is represented as a look-up table that specifies the stochastic hardening decisions as a function of the past execution history of the system. At the run time, hardening decisions are made simply by looking up this table. The proposed method finds hardening policies that adaptively reacts to the execution history of the system, allowing improvement in the CPU utilization. The method also deviates from the previous approaches’ viewpoint that reliability must be assessed in an all-or-nothing manner, by devising the notion of stochastic hardening policies. We evaluated the effectiveness of the proposed method using various task sets. In a set of 2,050 benchmarks, the system’s CPU utilization was improved by 2.80%-7.16% on average under different configurations. The improvement was by as high as 18.45% in the best benchmark.
format	article
author	Hyung-Chan An Hoeseok Yang
author_facet	Hyung-Chan An Hoeseok Yang
author_sort	Hyung-Chan An
title	Fully Adaptive Stochastic Handling of Soft-Errors in Real-Time Systems
title_short	Fully Adaptive Stochastic Handling of Soft-Errors in Real-Time Systems
title_full	Fully Adaptive Stochastic Handling of Soft-Errors in Real-Time Systems
title_fullStr	Fully Adaptive Stochastic Handling of Soft-Errors in Real-Time Systems
title_full_unstemmed	Fully Adaptive Stochastic Handling of Soft-Errors in Real-Time Systems
title_sort	fully adaptive stochastic handling of soft-errors in real-time systems
publisher	IEEE
publishDate	2021
url	https://doaj.org/article/713e9d9464e4437285936dc3564f47cf
work_keys_str_mv	AT hyungchanan fullyadaptivestochastichandlingofsofterrorsinrealtimesystems AT hoeseokyang fullyadaptivestochastichandlingofsofterrorsinrealtimesystems
_version_	1718409976697847808

Fully Adaptive Stochastic Handling of Soft-Errors in Real-Time Systems

Ejemplares similares