Timing analysis of expedient voting and runahead
Abstract Expedient voting and runahead have been suggested as ways to speed up the execution of fault-tolerant real-time software using N-version programming. We present an analysis of the probability density function of the execution time of these schemes. Execution times define the available time redundancy, and thus can affect the reliability of real-time systems.