@article{464,
abstract = {{Topological self-stabilization is an important concept to build robust open distributed systems (such as peer-to-peer systems) where nodes can organize themselves into meaningful network topologies. The goal is to devise distributed algorithms where nodes forward, insert, and delete links to neighboring nodes, and that converge quickly to such a desirable topology, independently of the initial network configuration. This article proposes a new model to study the parallel convergence time. Our model sheds light on the achievable parallelism by avoiding bottlenecks of existing models that can yield a distorted picture. As a case study, we consider local graph linearizationâ€”i.e., how to build a sorted list of the nodes of a connected graph in a distributed and self-stabilizing manner. In order to study the main structure and properties of our model, we propose two variants of a most simple local linearization algorithm. For each of these variants, we present analyses of the worst-case and bestcase parallel time complexities, as well as the performance under a greedy selection of the actions to be executed. It turns out that the analysis is non-trivial despite the simple setting, and to complement our formal insights we report on our experiments which indicate that the runtimes may be better in the average case.}},
author = {{Gall, Dominik and Jacob, Riko and Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and TĂ¤ubig, Hanjo }},
journal = {{Theory of Computing Systems}},
number = {{1}},
pages = {{110--135}},
publisher = {{Springer}},
title = {{{A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization}}},
doi = {{10.1007/s00224-013-9504-x}},
year = {{2014}},
}