TY - GEN
T1 - Linearization
T2 - 9th Workshop on Algorithm Engineering and Experiments and the 4th Workshop on Analytic Algorithms and Combinatorics
AU - Onus, Melih
AU - Richa, Andrea
AU - Scheideler, Christian
N1 - Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.
PY - 2007
Y1 - 2007
N2 - We consider the problem of designing a distributed algorithm that, given an arbitrary connected graph G of nodes with unique labels, converts G into a sorted list of nodes. This algorithm should be as simple as possible and, for scalability, should guarantee a polylogarithmic runtime as well as at most a polylogarithmic increase in the degree of each node during its execution. Furthermore, it should be selfstabilizing, that is, it should be able to eventually construct a sorted list from any state in which the graph is connected. It turns out that satisfying all of these demands at the same time is not easy. Our basic approach towards this goal is the so-called linearization technique: each node v repeatedly does the following with its neighbors: for its left (i.e., smaller) neighbors u1,... ,uk in the order of decreasing labels, v replaces {v, u1},..., {v, uk) by {v,u1},{u 1,U2}.....{uk-1,uk}, and ; for its right (i.e., larger) neighbors w1,..., we in the order of increasing labels, v replaces {v, w1), ..., {v, Well;) by {v,w 1},{w1,w2},...,{wℓ-1-w ℓ}. As shown in this paper, this technique transforms any connected graph into a sorted list, but there are graphs for which this can take a long time. Hence, we propose several extensions of the linearization technique and experimentally evaluate their performance. Our results indicate that some of these have a polylogarithmic performance, so there is hope that there are distributed algorithms that can achieve all of our goals above.
AB - We consider the problem of designing a distributed algorithm that, given an arbitrary connected graph G of nodes with unique labels, converts G into a sorted list of nodes. This algorithm should be as simple as possible and, for scalability, should guarantee a polylogarithmic runtime as well as at most a polylogarithmic increase in the degree of each node during its execution. Furthermore, it should be selfstabilizing, that is, it should be able to eventually construct a sorted list from any state in which the graph is connected. It turns out that satisfying all of these demands at the same time is not easy. Our basic approach towards this goal is the so-called linearization technique: each node v repeatedly does the following with its neighbors: for its left (i.e., smaller) neighbors u1,... ,uk in the order of decreasing labels, v replaces {v, u1},..., {v, uk) by {v,u1},{u 1,U2}.....{uk-1,uk}, and ; for its right (i.e., larger) neighbors w1,..., we in the order of increasing labels, v replaces {v, w1), ..., {v, Well;) by {v,w 1},{w1,w2},...,{wℓ-1-w ℓ}. As shown in this paper, this technique transforms any connected graph into a sorted list, but there are graphs for which this can take a long time. Hence, we propose several extensions of the linearization technique and experimentally evaluate their performance. Our results indicate that some of these have a polylogarithmic performance, so there is hope that there are distributed algorithms that can achieve all of our goals above.
UR - http://www.scopus.com/inward/record.url?scp=34547958947&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=34547958947&partnerID=8YFLogxK
U2 - 10.1137/1.9781611972870.10
DO - 10.1137/1.9781611972870.10
M3 - Conference contribution
AN - SCOPUS:34547958947
SN - 0898716284
SN - 9780898716283
T3 - Proceedings of the 9th Workshop on Algorithm Engineering and Experiments and the 4th Workshop on Analytic Algorithms and Combinatorics
SP - 99
EP - 108
BT - Proceedings of the 9th Workshop on Algorithm Engineering and Experiments and the 4th Workshop on Analytic Algorithms and Combinatorics
PB - Society for Industrial and Applied Mathematics Publications
Y2 - 6 January 2007 through 6 January 2007
ER -