Complexity of network synchronization
Journal of the ACM (JACM)
Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Cross-Over Composition - Enforcement of Fairness under Unfair Adversary
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
When graph theory helps self-stabilization
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Energy Optimisation in Resilient Self-Stabilizing Processes
PARELEC '06 Proceedings of the international symposium on Parallel Computing in Electrical Engineering
Introducing speculation in self-stabilization: an application to mutual exclusion
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
In this paper, we address the unison problem. We consider the self-stabilizing algorithm proposed by Boulinier et al. We exhibit a bound on the step complexity of its stabilization time. In more details, the stabilization time of this algorithm is at most 2Dn3 + (α + 1)n2 + (α -- 2D)n steps, where n is the number of processes, D is the diameter of the network, and α is a parameter of the algorithm.