Introduction to distributed algorithms
Introduction to distributed algorithms
Simulation of self-stabilizing algorithms in distributed systems
ANSS '92 Proceedings of the 25th annual symposium on Simulation
Self-stabilization
Derivation of Fault Tolerance Measures of Self-Stabilizing Algorithms by Simulation
ANSS-41 '08 Proceedings of the 41st Annual Simulation Symposium (anss-41 2008)
SFS3: a simulation framework for self-stabilizing systems
SpringSim '10 Proceedings of the 2010 Spring Simulation Multiconference
Algorithms and theory of computation handbook
Self-stabilization versus robust self-stabilization for clustering in ad-hoc network
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part I
| Hi-index | 0.00 |
We simulate a stabilizing propagation of information with feedback (PIF) program to evaluate its response to perturbations. Under several classic execution models, we vary the extent of the fault as well as the system scale. We study the program's speed of stabilization and overhead incurred by the fault. Our simulation provides insight into practical program behavior that is sometimes lacking in theoretical correctness proofs. This indicates that such simulation is a useful research tool in studies of fault tolerance.