liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • 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öping University, Department of Computer and Information Science, Software and Systems. Linköping University, Faculty of Science & Engineering. General Motors, USA.
Electr. & Comput. Eng., Carnegie Mellon Univ., Pittsburgh, PA, USA.
2018 (English)In: 30th Euromicro Conference on Real-Time Systems (ECRTS 2018)}, 2018Conference paper, Published paper (Refereed)
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.

Place, publisher, year, edition, pages
2018.
Keywords [en]
fault tolerance, real-time embedded systems, recovery time, real-time schedulability
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:liu:diva-150523DOI: 10.4230/LIPIcs.ECRTS.2018.23ISBN: 978-3-95977-075-0 (print)OAI: oai:DiVA.org:liu-150523DiVA, id: diva2:1241618
Conference
30th Euromicro Conference on Real-Time Systems (ECRTS 2018)
Available from: 2018-08-24 Created: 2018-08-24 Last updated: 2018-09-03

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full texthttp://drops.dagstuhl.de/opus/volltexte/2018/8980/

Search in DiVA

By author/editor
Samii, Soheil
By organisation
Software and SystemsFaculty of Science & Engineering
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 30 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf