| | |
Summary: Scheduling Optional Computations in Fault-Tolerant
Real-Time Systems *
Pedro Mejia-Alvarez t
CINVESTAV-IPN.Secci6n de Computaci6n
AV.I.P.N.2508, Zacatenco.
Mexico, DE 07300
pmejia@cs.cinvestav.mx
Abstract
This paper introduces an exact schedulability analysis for
the optional computation model urider a specified failure hy-
pothesis. From this analysis, we propose a solutionfor deter-
mining, before run-time, the degree of fault tolerance allowed
in the system. This analysis will allow the system designer to
verifL fall the tasks in the system meet their deadlines and to
decide which optional parts must be discarded if some dead-
lines would be missed. The identification of feasible options
that satisfL some optimality criteria requires the exploration
of a potentially large combinatorialspace of possible optional
parts to discard. Since this complexity is too high to be con-
sidered practical in dynamic systems, two heuristic algorithms
|
