Abstract
We present a silent self-stabilizing distributed algorithm computing a maximal $ p$-star decomposition of the underlying communication network. Under the unfair distributed scheduler, the most general scheduler model, the algorithm converges in at most $12Delta m + mathcalO(m+n)$ moves, where $m$ is the number of edges, $n$ is the number of nodes and $Delta $ is the maximum node degree. Regarding the time complexity, we obtain the following results: our algorithm outperforms the previously known best algorithm by a factor of $Delta $ with respect to the move complexity. While the round complexity for the previous algorithm was unknown, we show a $5big lfloor fracnp+1 big rfloor +5$ bound for our algorithm.
Original language | English |
---|---|
Pages (from-to) | 254-266 |
Number of pages | 13 |
Journal | Computer Journal |
Volume | 63 |
Issue number | 2 |
DOIs | |
State | Published - 19 Feb 2020 |
Externally published | Yes |
Bibliographical note
Publisher Copyright:© 2019 The British Computer Society 2019. All rights reserved. For permissions, please email: [email protected].
Funding
This study was partially supported by the anr project descartes: ANR-16-CE40-0023, anr project estate: ANR- 16 CE25-0009-03 and by the Sustainability Center Freiburg, Germany. The Sustainability Center Freiburg is a cooperation of the Fraunhofer Society and the University of Freiburg and is supported by grants from the Baden-Wrttemberg Ministry of Economics and the Baden-Wrttemberg Ministry of Science, Research and the Arts. This study was partially supported by the anr project descartes: ANR-16-CE40-0023, anr project estate: ANR-16 CE25-0009-03 and by the Sustainability Center Freiburg, Germany. The Sustainability Center Freiburg is a cooperation of the Fraunhofer Society and the University of Freiburg and is supported by grants from the Baden-Württemberg Ministry of Economics and the Baden-Württemberg Ministry of Science, Research and the Arts.
Funders | Funder number |
---|---|
Baden-Wrttemberg Ministry of Economics | |
Baden-Wrttemberg Ministry of Science, Research and the Arts | |
Baden-Württemberg Ministry of Economics | |
Fraunhofer Society | |
Albert-Ludwigs-Universität Freiburg | |
Fraunhofer-Gesellschaft | |
Ministerium für Wissenschaft, Forschung und Kunst Baden-Württemberg |
Keywords
- distributed algorithm
- graph decomposition
- move complexity
- p-star decomposition
- round complexity
- self-stabilization