| Abstract |
|
This paper deals with tolerance to timing faults in time-constrained systems. TAFT (Time Aware Fault-Tolerant) is a recently devised approach, which applies tolerance to timing violations. According to TAFT, a task is structured in a pair, to guarantee that deadlines are met (although possibly offering a degraded service) without requiring the knowledge of tasks attributes difficult to estimate in practice. Wide margin of actions is left by the TAFT approach in scheduling the task pairs, leading to disparate performances; up to now poor attention has been devoted to analyze this aspect.The goal of this work is to investigate on the most appropriate scheduling policies to adopt in a system structured in the TAFT fashion, in accordance with system conditions and application requirements. To this end, an experimental evaluation will be conducted, based on a variety of scheduling policies, to derive useful indications for the system designer about the most rewarding policies to apply.
|
 Additional Information
|
Citation:
F. Sandrini, F. Di Giandomenico, A. Bondavalli, E. Nett,
"Scheduling Solutions for Supporting Dependable Real-Time Applications,"
isorc,
p. 122,
Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing,
2000
|
