On efficiency of unison

@inproceedings{Devismes2012OnEO,
  title={On efficiency of unison},
  author={St{\'e}phane Devismes and Franck Petit},
  booktitle={TADDS},
  year={2012}
}
In this paper, we address the unison problem. We consider the self-stabilizing algorithm proposed by Boulinier <i>et al</i>. We exhibit a bound on the step complexity of its stabilization time. In more details, the stabilization time of this algorithm is at most 2<i>Dn</i><sup>3</sup> + (α + 1)<i>n</i><sup>2</sup> + (α -- 2<i>D</i>)<i>n</i> steps, where <i>n</i> is the number of processes, <i>D</i> is the diameter of the network, and α is a parameter of the algorithm.