liu.seSearch for publications in DiVA
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Recovery Time Considerations in Real-Time Systems Employing Software Fault Tolerance
Electr. & Comput. Eng., Carnegie Mellon Univ., Pittsburgh, PA, USA.
Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten. General Motors, USA.
Electr. & Comput. Eng., Carnegie Mellon Univ., Pittsburgh, PA, USA.
2018 (engelsk)Inngår i: 30th Euromicro Conference on Real-Time Systems (ECRTS 2018)}, 2018Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

Safety-critical real-time systems like modern automobiles with advanced driving-assist features must employ redundancy for crucial software tasks to tolerate permanent crash faults. This redundancy can be achieved by using techniques like active replication or the primary-backup approach. In such systems, the recovery time which is the amount of time it takes for a redundant task to take over execution on the failure of a primary task becomes a very important design parameter. The recovery time for a given task depends on various factors like task allocation, primary and redundant task priorities, system load and the scheduling policy. Each task can also have a different recovery time requirement (RTR). For example, in automobiles with automated driving features, safety-critical tasks like perception and steering control have strict RTRs, whereas such requirements are more relaxed in the case of tasks like heating control and mission planning. In this paper, we analyze the recovery time for software tasks in a real-time system employing Rate-Monotonic Scheduling (RMS). We derive bounds on the recovery times for different redundant task options and propose techniques to determine the redundant-task type for a task to satisfy its RTR. We also address the fault-tolerant task allocation problem, with the additional constraint of satisfying the RTR of each task in the system. Given that the problem of assigning tasks to processors is a well-known NP-hard bin-packing problem we propose computationally-efficient heuristics to find a feasible allocation of tasks and their redundant copies. We also apply the simulated annealing method to the fault-tolerant task allocation problem with RTR constraints and compare against our heuristics.

sted, utgiver, år, opplag, sider
2018.
Emneord [en]
fault tolerance, real-time embedded systems, recovery time, real-time schedulability
HSV kategori
Identifikatorer
URN: urn:nbn:se:liu:diva-150523DOI: 10.4230/LIPIcs.ECRTS.2018.23ISBN: 978-3-95977-075-0 (tryckt)OAI: oai:DiVA.org:liu-150523DiVA, id: diva2:1241618
Konferanse
30th Euromicro Conference on Real-Time Systems (ECRTS 2018)
Tilgjengelig fra: 2018-08-24 Laget: 2018-08-24 Sist oppdatert: 2018-09-03

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fullteksthttp://drops.dagstuhl.de/opus/volltexte/2018/8980/

Søk i DiVA

Av forfatter/redaktør
Samii, Soheil
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 30 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf