Self-stabilizing algorithms recover from all cases of transient failure, but the mechanism of self-stabilization may be costly for mild cases of transient failure. Error-detecting codes can be used to identify, with high probability, transient faults in data. This note investigates how error-detecting codes can enhance self-stabilization to deal efficiently with the common case of single-process transient faults. The main results are characterizations of self-stabilizing algorithms that can use error-detecting codes to recover from single-process transient faults in a single step. (C) 2000
istics increase the number of faults which may hit the system. For instance, in WSNs, processes are ...
National audienceIn 1974, E.W. Dijkstra defined self-stabilization as the property for a distributed...
The analysis of self-stabilizing algorithms is often limited to the worst case stabilization time st...
This paper revisits the interconnection of self-stabilization and fault-tolerance. Self-stabilizing ...
. Self-stabilization provides a non-masking approach to fault tolerance. Given this fact, one would ...
Dijkstra's concept of self-stabilization assumes that faults can only affect the variables of a...
When a distributed system is subject to transient failures that arbitrarily modify its state, it is ...
Embedded systems are increasingly deployed in harsh environments that their components were not nece...
Soft errors are increasing in modern computer systems. These faults can corrupt the results of nume...
Abstract. Self-stabilization is an elegant way of realizing non-masking fault-tolerant systems. Sust...
\ua9 Springer International Publishing AG 2017.Current reconfiguration techniques depend on starting...
Scientific Context. Modern networks are very large-scale (about 100 000 nodes). Now, the more a netw...
Abstract Self-stabilizing algorithms are designed to guarantee convergence to some desired stable st...
A self-stabilizing system is one which can recover from transient faults in a nite number of steps. ...
Abstract—We propose a new metric for effectively and accu-rately evaluating the performance of self-...
istics increase the number of faults which may hit the system. For instance, in WSNs, processes are ...
National audienceIn 1974, E.W. Dijkstra defined self-stabilization as the property for a distributed...
The analysis of self-stabilizing algorithms is often limited to the worst case stabilization time st...
This paper revisits the interconnection of self-stabilization and fault-tolerance. Self-stabilizing ...
. Self-stabilization provides a non-masking approach to fault tolerance. Given this fact, one would ...
Dijkstra's concept of self-stabilization assumes that faults can only affect the variables of a...
When a distributed system is subject to transient failures that arbitrarily modify its state, it is ...
Embedded systems are increasingly deployed in harsh environments that their components were not nece...
Soft errors are increasing in modern computer systems. These faults can corrupt the results of nume...
Abstract. Self-stabilization is an elegant way of realizing non-masking fault-tolerant systems. Sust...
\ua9 Springer International Publishing AG 2017.Current reconfiguration techniques depend on starting...
Scientific Context. Modern networks are very large-scale (about 100 000 nodes). Now, the more a netw...
Abstract Self-stabilizing algorithms are designed to guarantee convergence to some desired stable st...
A self-stabilizing system is one which can recover from transient faults in a nite number of steps. ...
Abstract—We propose a new metric for effectively and accu-rately evaluating the performance of self-...
istics increase the number of faults which may hit the system. For instance, in WSNs, processes are ...
National audienceIn 1974, E.W. Dijkstra defined self-stabilization as the property for a distributed...
The analysis of self-stabilizing algorithms is often limited to the worst case stabilization time st...