CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

On the probability of detecting data errors generated by permanent faults using time redundancy

Joakim Aidemark (Institutionen för datorteknik) ; Peter Folkesson (Institutionen för datorteknik) ; Johan Karlsson (Institutionen för datorteknik)
Proceedings of the 9th IEEE International On-Line Testing Symposium, Kos, 7-9 July 2003 p. 68-74. (2003)
[Konferensbidrag, refereegranskat]

Time redundant execution of tasks and comparison of results is a well-known technique for detecting transient faults in computer systems. However, time redundancy is also capable of detecting permanent faults that occur during or between the executions of two task replicas, provided the faults affect the results of the two tasks in different ways. In this paper, we derive an expression for estimating the probability of detecting data errors generated by permanent faults with time redundant execution. The expression is validated experimentally by injecting permanent stuck-at faults into a multiplier unit of a microprocessor. We use the derived expression to show how tasks can be scheduled to improve the detection probability of errors generated by permanent faults. We also show that the detection capability of permanent faults is low for the Temporal Error Masking (TEM) technique (i.e. triplicated execution and voting to mask transient faults) and may not be increased by scheduling. Thus, we propose complementing TEM with special test tasks.

Denna post skapades 2013-02-20.
CPL Pubid: 173892


Läs direkt!

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för datorteknik (2002-2004)



Chalmers infrastruktur