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
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
Dependability: Basic Concepts and Terminology
Dependability: Basic Concepts and Terminology
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
Measuring and policing blocking times in real-time systems
ACM Transactions on Embedded Computing Systems (TECS)
| Hi-index | 0.00 |
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 latest absolute time 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 overruns before a deadline miss. LET use the allowance notion which depends on free CPU resources. We show how to determine the LET based on existing real-time feasibility conditions for fixed scheduling FP/HPF. We then integrate the LET in an existing RTSJ compliant system and analyze its performances.