Fault-tolerant scheduling under time and resource constraints

S. Ghosh et al. (1998) presented a novel approach for providing fault tolerance for sets of independent, periodic tasks with rate-monotonic scheduling. We extend this approach to tasks that share logical or physical resources (and hence require synchronization). We show that if the simple rate-monotonic dispatch is replaced by stack scheduling (T. Baker, 1991), the worst-case blocking overhead of the stack resource policy and the worst-case retry overhead for fault tolerance are not additive, but rather only the maximum of the two overheads is incurred