Scheduling Algorithms for Dependability
Rate-monotonic scheduling (RTS) is becoming a viable scheduling discipline
for real-time systems. With its ease of implementation and and its
optimality, RTS is a powerful vehicle in guaranteeing deadlines in
hard real-time environments. However, it can only do so as long as no
processors fail or processes never produce erroneous results.
Unfortunately, processors fail in reality, and tasks do produce erroneous
results, especially in a large complex system.
In order to support dependability of real-time systems, we study the problem
of guaranteeing hard deadlines even in the presence of processor failures
and/or process errors.
Last modified: Mon Oct 2 18:34:05 EDT 1995 [SK]