A least upper bound on the fault tolerance of real-time systems
- Autores
- Santos, Rodrigo Martin; Santos, Jorge; Orozco, Javier Dario
- Año de publicación
- 2005
- Idioma
- inglés
- Tipo de recurso
- artículo
- Estado
- versión publicada
- Descripción
- This paper presents a method to deal with the reexecution of tasks in a hard real-time system subject to temporary faults. The set of tasks follows the Liu and Layland model: they are periodic, independent and preemptible. Time is considered to be slotted. The system is said to be ki-schedulable if it is schedulable in spite of the fact that in the interval between its release and its deadline, every task admits that ki slots are devoted to uses other than its first execution. In this case, the ki slots are used to reexecute tasks subject to temporary faults. Since the value of ki can be easily determined, a least upper bound on all the possible combinations of faults that the system can tolerate while meeting the hard time-constraints, follows immediately. The method is bandwidth preserving and the expression of the bound is a diophantic inequality relating ki, the execution time and the period of each task. The method is compared to methods proposed by other authors to solve the same problem and it is evaluated through extensive simulations performed on random generated sets of tasks.
Fil: Santos, Rodrigo Martin. Universidad Nacional del Sur. Departamento de Ingeniería Eléctrica y de Computadoras; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca; Argentina
Fil: Santos, Jorge. Universidad Nacional del Sur. Departamento de Ingeniería Eléctrica y de Computadoras; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca; Argentina
Fil: Orozco, Javier Dario. Universidad Nacional del Sur. Departamento de Ingeniería Eléctrica y de Computadoras; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca; Argentina - Materia
-
Real Time
Fault-tolerance
Schedulability - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
- Repositorio
- Institución
- Consejo Nacional de Investigaciones Científicas y Técnicas
- OAI Identificador
- oai:ri.conicet.gov.ar:11336/104449
Ver los metadatos del registro completo
id |
CONICETDig_b0d197748e483b8b0060defd6e3df6ad |
---|---|
oai_identifier_str |
oai:ri.conicet.gov.ar:11336/104449 |
network_acronym_str |
CONICETDig |
repository_id_str |
3498 |
network_name_str |
CONICET Digital (CONICET) |
spelling |
A least upper bound on the fault tolerance of real-time systemsSantos, Rodrigo MartinSantos, JorgeOrozco, Javier DarioReal TimeFault-toleranceSchedulabilityhttps://purl.org/becyt/ford/2.2https://purl.org/becyt/ford/2This paper presents a method to deal with the reexecution of tasks in a hard real-time system subject to temporary faults. The set of tasks follows the Liu and Layland model: they are periodic, independent and preemptible. Time is considered to be slotted. The system is said to be ki-schedulable if it is schedulable in spite of the fact that in the interval between its release and its deadline, every task admits that ki slots are devoted to uses other than its first execution. In this case, the ki slots are used to reexecute tasks subject to temporary faults. Since the value of ki can be easily determined, a least upper bound on all the possible combinations of faults that the system can tolerate while meeting the hard time-constraints, follows immediately. The method is bandwidth preserving and the expression of the bound is a diophantic inequality relating ki, the execution time and the period of each task. The method is compared to methods proposed by other authors to solve the same problem and it is evaluated through extensive simulations performed on random generated sets of tasks.Fil: Santos, Rodrigo Martin. Universidad Nacional del Sur. Departamento de Ingeniería Eléctrica y de Computadoras; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca; ArgentinaFil: Santos, Jorge. Universidad Nacional del Sur. Departamento de Ingeniería Eléctrica y de Computadoras; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca; ArgentinaFil: Orozco, Javier Dario. Universidad Nacional del Sur. Departamento de Ingeniería Eléctrica y de Computadoras; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca; ArgentinaElsevier Science Inc2005-10-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/104449Santos, Rodrigo Martin; Santos, Jorge; Orozco, Javier Dario; A least upper bound on the fault tolerance of real-time systems; Elsevier Science Inc; Journal Of Systems And Software; 78; 1; 01-10-2005; 47-550164-1212CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S016412120400233Xinfo:eu-repo/semantics/altIdentifier/doi/10.1016/j.jss.2004.11.021info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-10-15T15:11:53Zoai:ri.conicet.gov.ar:11336/104449instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-10-15 15:11:53.481CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse |
dc.title.none.fl_str_mv |
A least upper bound on the fault tolerance of real-time systems |
title |
A least upper bound on the fault tolerance of real-time systems |
spellingShingle |
A least upper bound on the fault tolerance of real-time systems Santos, Rodrigo Martin Real Time Fault-tolerance Schedulability |
title_short |
A least upper bound on the fault tolerance of real-time systems |
title_full |
A least upper bound on the fault tolerance of real-time systems |
title_fullStr |
A least upper bound on the fault tolerance of real-time systems |
title_full_unstemmed |
A least upper bound on the fault tolerance of real-time systems |
title_sort |
A least upper bound on the fault tolerance of real-time systems |
dc.creator.none.fl_str_mv |
Santos, Rodrigo Martin Santos, Jorge Orozco, Javier Dario |
author |
Santos, Rodrigo Martin |
author_facet |
Santos, Rodrigo Martin Santos, Jorge Orozco, Javier Dario |
author_role |
author |
author2 |
Santos, Jorge Orozco, Javier Dario |
author2_role |
author author |
dc.subject.none.fl_str_mv |
Real Time Fault-tolerance Schedulability |
topic |
Real Time Fault-tolerance Schedulability |
purl_subject.fl_str_mv |
https://purl.org/becyt/ford/2.2 https://purl.org/becyt/ford/2 |
dc.description.none.fl_txt_mv |
This paper presents a method to deal with the reexecution of tasks in a hard real-time system subject to temporary faults. The set of tasks follows the Liu and Layland model: they are periodic, independent and preemptible. Time is considered to be slotted. The system is said to be ki-schedulable if it is schedulable in spite of the fact that in the interval between its release and its deadline, every task admits that ki slots are devoted to uses other than its first execution. In this case, the ki slots are used to reexecute tasks subject to temporary faults. Since the value of ki can be easily determined, a least upper bound on all the possible combinations of faults that the system can tolerate while meeting the hard time-constraints, follows immediately. The method is bandwidth preserving and the expression of the bound is a diophantic inequality relating ki, the execution time and the period of each task. The method is compared to methods proposed by other authors to solve the same problem and it is evaluated through extensive simulations performed on random generated sets of tasks. Fil: Santos, Rodrigo Martin. Universidad Nacional del Sur. Departamento de Ingeniería Eléctrica y de Computadoras; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca; Argentina Fil: Santos, Jorge. Universidad Nacional del Sur. Departamento de Ingeniería Eléctrica y de Computadoras; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca; Argentina Fil: Orozco, Javier Dario. Universidad Nacional del Sur. Departamento de Ingeniería Eléctrica y de Computadoras; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca; Argentina |
description |
This paper presents a method to deal with the reexecution of tasks in a hard real-time system subject to temporary faults. The set of tasks follows the Liu and Layland model: they are periodic, independent and preemptible. Time is considered to be slotted. The system is said to be ki-schedulable if it is schedulable in spite of the fact that in the interval between its release and its deadline, every task admits that ki slots are devoted to uses other than its first execution. In this case, the ki slots are used to reexecute tasks subject to temporary faults. Since the value of ki can be easily determined, a least upper bound on all the possible combinations of faults that the system can tolerate while meeting the hard time-constraints, follows immediately. The method is bandwidth preserving and the expression of the bound is a diophantic inequality relating ki, the execution time and the period of each task. The method is compared to methods proposed by other authors to solve the same problem and it is evaluated through extensive simulations performed on random generated sets of tasks. |
publishDate |
2005 |
dc.date.none.fl_str_mv |
2005-10-01 |
dc.type.none.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion http://purl.org/coar/resource_type/c_6501 info:ar-repo/semantics/articulo |
format |
article |
status_str |
publishedVersion |
dc.identifier.none.fl_str_mv |
http://hdl.handle.net/11336/104449 Santos, Rodrigo Martin; Santos, Jorge; Orozco, Javier Dario; A least upper bound on the fault tolerance of real-time systems; Elsevier Science Inc; Journal Of Systems And Software; 78; 1; 01-10-2005; 47-55 0164-1212 CONICET Digital CONICET |
url |
http://hdl.handle.net/11336/104449 |
identifier_str_mv |
Santos, Rodrigo Martin; Santos, Jorge; Orozco, Javier Dario; A least upper bound on the fault tolerance of real-time systems; Elsevier Science Inc; Journal Of Systems And Software; 78; 1; 01-10-2005; 47-55 0164-1212 CONICET Digital CONICET |
dc.language.none.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S016412120400233X info:eu-repo/semantics/altIdentifier/doi/10.1016/j.jss.2004.11.021 |
dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess https://creativecommons.org/licenses/by-nc-sa/2.5/ar/ |
eu_rights_str_mv |
openAccess |
rights_invalid_str_mv |
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/ |
dc.format.none.fl_str_mv |
application/pdf application/pdf application/pdf |
dc.publisher.none.fl_str_mv |
Elsevier Science Inc |
publisher.none.fl_str_mv |
Elsevier Science Inc |
dc.source.none.fl_str_mv |
reponame:CONICET Digital (CONICET) instname:Consejo Nacional de Investigaciones Científicas y Técnicas |
reponame_str |
CONICET Digital (CONICET) |
collection |
CONICET Digital (CONICET) |
instname_str |
Consejo Nacional de Investigaciones Científicas y Técnicas |
repository.name.fl_str_mv |
CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas |
repository.mail.fl_str_mv |
dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar |
_version_ |
1846083267011280896 |
score |
13.22299 |