This paper extends the basic model of probabilistic time-redundant task execution to achieve an even better resource efficiency: It allows different algorithms for the primary and secondary instances of tasks. The presented work provides methods for computing the time consumption of tasks in this model. It presents strategies for selecting algorithms for primary and secondary task instances and illustrates how this model is used to save CPU-time.
@inproceedings{Puschner:EFTS1998,
author = "Peter Puschner",
title = "Saving Resources in Fault-Tolerant Embedded Real-Time Systems by Using Diverse Software in Probabilistic Time-Redundant Task Execution",
booktitle = "Proc. Workshop on Embedded Fault-Tolerant Systems",
year = "1998",
month = "May",
pages = "38-43"
}