Imprecise computation fault-tolerant rate-monotonic scheduling

Fault-tolerant real-time scheduling is a hot topic in dependable real-time system research. We combine the FT-RM with imprecise computation to increase the upper bound of resource utilization in the absence of faults. We prove that every task can meet its deadline in a specified interval, no matter whether there is a fault.