Failure prevention of real-time systems based on the latest execution time

Authors:
Lamine Bougueroua;Laurent George;Serge Midonnet
Affiliations:
ESIGETEL, Avon and Univ. Paris 12, LISSI, Vitry sur Seine;Univ. Paris 12, LISSI, Vitry sur Seine and ECE, LACSC, Paris;ESIGETEL, Avon
Venue:
RTC'05 Proceedings of the 14th IEEE-NPSS conference on Real time
Year:
2005

Citing 8
Cited 0

Some Results of the Earliest Deadline Scheduling Algorithm

IEEE Transactions on Software Engineering
An extendible approach for analyzing fixed priority hard real-time tasks

Real-Time Systems
Computing Maximum Task Execution Times — A Graph-BasedApproach

Real-Time Systems
An Optimal Algorithm for Scheduling Soft Aperiodic Tasks in Dynamic-Priority Preemptive Systems

IEEE Transactions on Software Engineering
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
The Real-Time Specification for Java

The Real-Time Specification for Java
Tolerating Transient Faults in Statically Scheduled Safety-Critical Embedded Systems

SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
Best-effort decision-making for real-time scheduling

Best-effort decision-making for real-time scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a mechanism for execution-overrun management in real-time systems. Based on fault prevention, we determine the latest execution time (LET) of a task defined as the date a faulty task can proceed with its execution without compromising the real-time constraints of all the tasks in the system. This mechanism enables to cope with execution overrun before a deadline miss. LET use the allowance notion which is depends on free resources. We show how to determine the LET value and how to integrate this mechanism into existing real-time feasibility conditions for fixed scheduling FP/HPF.