Information Processing Letters
Introduction to distributed algorithms
Introduction to distributed algorithms
Information Processing Letters
Fault-local distributed mending (extended abstract)
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
SuperStabilizing protocols for dynamic distributed systems
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Fault-containing self-stabilizing algorithms
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Time-adaptive self stabilization
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Asynchronous time-adaptive self stabilization
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Optimal reactive k-stabilization: the case of mutual exclusion
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Self-stabilization
Error-detecting codes and fault-containing self-stabilization
Information Processing Letters
Distributed computing: fundamentals, simulations and advanced topics
Distributed computing: fundamentals, simulations and advanced topics
Tolerance to Unbounded Byzantine Faults
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
A Lower Bound on Dynamic k-Stabilization in Asynchronous Systems
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Superstabilizing mutual exclusion
Distributed Computing
Necessary and sufficient conditions for 1-adaptivity
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Synchronous vs. asynchronous unison
SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
Adaptive stabilization of reactive protocols
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Fault-Containment in Weakly-Stabilizing Systems
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Self-stabilizing with service guarantee construction of 1-hop weight-based bounded size clusters
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
In this paper we study k-strong self-stabilizing systems, which satisfy the properties of strong confinement and of k-linear time adaptivity. Strong confinement means that a non faulty processor has the same behavior with or without the presence of faults elsewhere in the system (in other words faults are confined). k-linear time adaptivity means that after k or less faults hitting the system in a correct state, the recovery takes a number of rounds linear in k. We show, under some conditions, how an asynchronous self-stabilizing system can be automatically transformed into an equivalent synchronous 1-strong self-stabilizing system where the recovery takes at most 3 rounds. We present in detail the transformer as well as a 1-strong synchronous unison algorithm. We also discuss how the construction can be extended to the k-strong case, for an arbitrary k.