The Experts below are selected from a list of 51 Experts worldwide ranked by ideXlab platform
Devan Sohier - One of the best experts on this subject based on the ideXlab platform.
-
SIROCCO - A Self-Stabilizing Algorithm for Maximal Matching in Link-Register Model
Structural Information and Communication Complexity, 2018Co-Authors: Johanne Cohen, George Manoussakis, Laurence Pilard, Devan SohierAbstract:This paper presents a new distributed self-stabilizing algorithm solving the maximal matching problem under the fair distributed daemon. This is the first maximal matching algorithm in the Link-Register model under read/write atomicity. This work is composed of two parts. As we cannot establish a move complexity analysis under the fair distributed daemon, we first design an algorithm \(\mathcal A_{1} \) under the unfair distributed daemon dealing with some relaxed constraints on the communication model. Second, we adapt \(\mathcal A_{1} \) so that it can handle the fair distributed daemon, leading to the \(\mathcal A_{2} \) algorithm. We prove that algorithm \(\mathcal A_1\) stabilizes in \(O(m\Delta )\) moves and algorithm \(\mathcal A_2\) in \(O(m\Delta )\) rounds, with \(\Delta \) the maximum degree and m the number of edges.
-
a self stabilizing algorithm for maximal matching in Link Register model
International Colloquium on Structural Information and Communication Complexity, 2018Co-Authors: Johanne Cohen, George Manoussakis, Laurence Pilard, Devan SohierAbstract:This paper presents a new distributed self-stabilizing algorithm solving the maximal matching problem under the fair distributed daemon. This is the first maximal matching algorithm in the Link-Register model under read/write atomicity. This work is composed of two parts. As we cannot establish a move complexity analysis under the fair distributed daemon, we first design an algorithm \(\mathcal A_{1} \) under the unfair distributed daemon dealing with some relaxed constraints on the communication model. Second, we adapt \(\mathcal A_{1} \) so that it can handle the fair distributed daemon, leading to the \(\mathcal A_{2} \) algorithm. We prove that algorithm \(\mathcal A_1\) stabilizes in \(O(m\Delta )\) moves and algorithm \(\mathcal A_2\) in \(O(m\Delta )\) rounds, with \(\Delta \) the maximum degree and m the number of edges.
-
a self stabilizing algorithm for maximal matching in Link Register model in o n delta 3 moves
arXiv: Distributed Parallel and Cluster Computing, 2017Co-Authors: Johanne Cohen, George Manoussakis, Laurence Pilard, Devan SohierAbstract:In the matching problem, each node maintains a pointer to one of its neighbor or to $null$, and a maximal matching is computed when each node points either to a neighbor that itself points to it (they are then called married), or to $null$, in which case no neighbor can also point to $null$. This paper presents a self-stabilizing distributed algorithm to compute a maximal matching in the Link-Register model under read/write atomicity, with complexity {$O(n\Delta^3)$} moves under the adversarial distributed daemon, where $\Delta$ is the maximum degree of the graph.
-
A self-stabilizing algorithm for maximal matching in Link-Register model in $O(n\Delta^3)$ moves
arXiv: Distributed Parallel and Cluster Computing, 2017Co-Authors: Johanne Cohen, George Manoussakis, Laurence Pilard, Devan SohierAbstract:In the matching problem, each node maintains a pointer to one of its neighbor or to $null$, and a maximal matching is computed when each node points either to a neighbor that itself points to it (they are then called married), or to $null$, in which case no neighbor can also point to $null$. This paper presents a self-stabilizing distributed algorithm to compute a maximal matching in the Link-Register model under read/write atomicity, with complexity {$O(n\Delta^3)$} moves under the adversarial distributed daemon, where $\Delta$ is the maximum degree of the graph.
-
Self-Stabilizing Maximal Matching and Anonymous Networks.
arXiv: Distributed Parallel and Cluster Computing, 2016Co-Authors: Johanne Cohen, Laurence Pilard, Jonas Lefèvre, Khaled Maamra, Devan SohierAbstract:We propose a self-stabilizing algorithm for computing a maximal matching in an anonymous network. The complexity is $O(n^3)$ moves with high probability, under the adversarial distributed daemon. In this algorithm, each node can determine whether one of its neighbors points to it or to another node, leading to a contradiction with the anonymous assumption. To solve this problem, we provide under the classical Link-Register model, a self-stabilizing algorithm that gives a unique name to a Link such that this name is shared by both extremities of the Link.
Johanne Cohen - One of the best experts on this subject based on the ideXlab platform.
-
SIROCCO - A Self-Stabilizing Algorithm for Maximal Matching in Link-Register Model
Structural Information and Communication Complexity, 2018Co-Authors: Johanne Cohen, George Manoussakis, Laurence Pilard, Devan SohierAbstract:This paper presents a new distributed self-stabilizing algorithm solving the maximal matching problem under the fair distributed daemon. This is the first maximal matching algorithm in the Link-Register model under read/write atomicity. This work is composed of two parts. As we cannot establish a move complexity analysis under the fair distributed daemon, we first design an algorithm \(\mathcal A_{1} \) under the unfair distributed daemon dealing with some relaxed constraints on the communication model. Second, we adapt \(\mathcal A_{1} \) so that it can handle the fair distributed daemon, leading to the \(\mathcal A_{2} \) algorithm. We prove that algorithm \(\mathcal A_1\) stabilizes in \(O(m\Delta )\) moves and algorithm \(\mathcal A_2\) in \(O(m\Delta )\) rounds, with \(\Delta \) the maximum degree and m the number of edges.
-
a self stabilizing algorithm for maximal matching in Link Register model
International Colloquium on Structural Information and Communication Complexity, 2018Co-Authors: Johanne Cohen, George Manoussakis, Laurence Pilard, Devan SohierAbstract:This paper presents a new distributed self-stabilizing algorithm solving the maximal matching problem under the fair distributed daemon. This is the first maximal matching algorithm in the Link-Register model under read/write atomicity. This work is composed of two parts. As we cannot establish a move complexity analysis under the fair distributed daemon, we first design an algorithm \(\mathcal A_{1} \) under the unfair distributed daemon dealing with some relaxed constraints on the communication model. Second, we adapt \(\mathcal A_{1} \) so that it can handle the fair distributed daemon, leading to the \(\mathcal A_{2} \) algorithm. We prove that algorithm \(\mathcal A_1\) stabilizes in \(O(m\Delta )\) moves and algorithm \(\mathcal A_2\) in \(O(m\Delta )\) rounds, with \(\Delta \) the maximum degree and m the number of edges.
-
a self stabilizing algorithm for maximal matching in Link Register model in o n delta 3 moves
arXiv: Distributed Parallel and Cluster Computing, 2017Co-Authors: Johanne Cohen, George Manoussakis, Laurence Pilard, Devan SohierAbstract:In the matching problem, each node maintains a pointer to one of its neighbor or to $null$, and a maximal matching is computed when each node points either to a neighbor that itself points to it (they are then called married), or to $null$, in which case no neighbor can also point to $null$. This paper presents a self-stabilizing distributed algorithm to compute a maximal matching in the Link-Register model under read/write atomicity, with complexity {$O(n\Delta^3)$} moves under the adversarial distributed daemon, where $\Delta$ is the maximum degree of the graph.
-
A self-stabilizing algorithm for maximal matching in Link-Register model in $O(n\Delta^3)$ moves
arXiv: Distributed Parallel and Cluster Computing, 2017Co-Authors: Johanne Cohen, George Manoussakis, Laurence Pilard, Devan SohierAbstract:In the matching problem, each node maintains a pointer to one of its neighbor or to $null$, and a maximal matching is computed when each node points either to a neighbor that itself points to it (they are then called married), or to $null$, in which case no neighbor can also point to $null$. This paper presents a self-stabilizing distributed algorithm to compute a maximal matching in the Link-Register model under read/write atomicity, with complexity {$O(n\Delta^3)$} moves under the adversarial distributed daemon, where $\Delta$ is the maximum degree of the graph.
-
Self-Stabilizing Maximal Matching and Anonymous Networks.
arXiv: Distributed Parallel and Cluster Computing, 2016Co-Authors: Johanne Cohen, Laurence Pilard, Jonas Lefèvre, Khaled Maamra, Devan SohierAbstract:We propose a self-stabilizing algorithm for computing a maximal matching in an anonymous network. The complexity is $O(n^3)$ moves with high probability, under the adversarial distributed daemon. In this algorithm, each node can determine whether one of its neighbors points to it or to another node, leading to a contradiction with the anonymous assumption. To solve this problem, we provide under the classical Link-Register model, a self-stabilizing algorithm that gives a unique name to a Link such that this name is shared by both extremities of the Link.
Laurence Pilard - One of the best experts on this subject based on the ideXlab platform.
-
SIROCCO - A Self-Stabilizing Algorithm for Maximal Matching in Link-Register Model
Structural Information and Communication Complexity, 2018Co-Authors: Johanne Cohen, George Manoussakis, Laurence Pilard, Devan SohierAbstract:This paper presents a new distributed self-stabilizing algorithm solving the maximal matching problem under the fair distributed daemon. This is the first maximal matching algorithm in the Link-Register model under read/write atomicity. This work is composed of two parts. As we cannot establish a move complexity analysis under the fair distributed daemon, we first design an algorithm \(\mathcal A_{1} \) under the unfair distributed daemon dealing with some relaxed constraints on the communication model. Second, we adapt \(\mathcal A_{1} \) so that it can handle the fair distributed daemon, leading to the \(\mathcal A_{2} \) algorithm. We prove that algorithm \(\mathcal A_1\) stabilizes in \(O(m\Delta )\) moves and algorithm \(\mathcal A_2\) in \(O(m\Delta )\) rounds, with \(\Delta \) the maximum degree and m the number of edges.
-
a self stabilizing algorithm for maximal matching in Link Register model
International Colloquium on Structural Information and Communication Complexity, 2018Co-Authors: Johanne Cohen, George Manoussakis, Laurence Pilard, Devan SohierAbstract:This paper presents a new distributed self-stabilizing algorithm solving the maximal matching problem under the fair distributed daemon. This is the first maximal matching algorithm in the Link-Register model under read/write atomicity. This work is composed of two parts. As we cannot establish a move complexity analysis under the fair distributed daemon, we first design an algorithm \(\mathcal A_{1} \) under the unfair distributed daemon dealing with some relaxed constraints on the communication model. Second, we adapt \(\mathcal A_{1} \) so that it can handle the fair distributed daemon, leading to the \(\mathcal A_{2} \) algorithm. We prove that algorithm \(\mathcal A_1\) stabilizes in \(O(m\Delta )\) moves and algorithm \(\mathcal A_2\) in \(O(m\Delta )\) rounds, with \(\Delta \) the maximum degree and m the number of edges.
-
a self stabilizing algorithm for maximal matching in Link Register model in o n delta 3 moves
arXiv: Distributed Parallel and Cluster Computing, 2017Co-Authors: Johanne Cohen, George Manoussakis, Laurence Pilard, Devan SohierAbstract:In the matching problem, each node maintains a pointer to one of its neighbor or to $null$, and a maximal matching is computed when each node points either to a neighbor that itself points to it (they are then called married), or to $null$, in which case no neighbor can also point to $null$. This paper presents a self-stabilizing distributed algorithm to compute a maximal matching in the Link-Register model under read/write atomicity, with complexity {$O(n\Delta^3)$} moves under the adversarial distributed daemon, where $\Delta$ is the maximum degree of the graph.
-
A self-stabilizing algorithm for maximal matching in Link-Register model in $O(n\Delta^3)$ moves
arXiv: Distributed Parallel and Cluster Computing, 2017Co-Authors: Johanne Cohen, George Manoussakis, Laurence Pilard, Devan SohierAbstract:In the matching problem, each node maintains a pointer to one of its neighbor or to $null$, and a maximal matching is computed when each node points either to a neighbor that itself points to it (they are then called married), or to $null$, in which case no neighbor can also point to $null$. This paper presents a self-stabilizing distributed algorithm to compute a maximal matching in the Link-Register model under read/write atomicity, with complexity {$O(n\Delta^3)$} moves under the adversarial distributed daemon, where $\Delta$ is the maximum degree of the graph.
-
Self-Stabilizing Maximal Matching and Anonymous Networks.
arXiv: Distributed Parallel and Cluster Computing, 2016Co-Authors: Johanne Cohen, Laurence Pilard, Jonas Lefèvre, Khaled Maamra, Devan SohierAbstract:We propose a self-stabilizing algorithm for computing a maximal matching in an anonymous network. The complexity is $O(n^3)$ moves with high probability, under the adversarial distributed daemon. In this algorithm, each node can determine whether one of its neighbors points to it or to another node, leading to a contradiction with the anonymous assumption. To solve this problem, we provide under the classical Link-Register model, a self-stabilizing algorithm that gives a unique name to a Link such that this name is shared by both extremities of the Link.
George Manoussakis - One of the best experts on this subject based on the ideXlab platform.
-
SIROCCO - A Self-Stabilizing Algorithm for Maximal Matching in Link-Register Model
Structural Information and Communication Complexity, 2018Co-Authors: Johanne Cohen, George Manoussakis, Laurence Pilard, Devan SohierAbstract:This paper presents a new distributed self-stabilizing algorithm solving the maximal matching problem under the fair distributed daemon. This is the first maximal matching algorithm in the Link-Register model under read/write atomicity. This work is composed of two parts. As we cannot establish a move complexity analysis under the fair distributed daemon, we first design an algorithm \(\mathcal A_{1} \) under the unfair distributed daemon dealing with some relaxed constraints on the communication model. Second, we adapt \(\mathcal A_{1} \) so that it can handle the fair distributed daemon, leading to the \(\mathcal A_{2} \) algorithm. We prove that algorithm \(\mathcal A_1\) stabilizes in \(O(m\Delta )\) moves and algorithm \(\mathcal A_2\) in \(O(m\Delta )\) rounds, with \(\Delta \) the maximum degree and m the number of edges.
-
a self stabilizing algorithm for maximal matching in Link Register model
International Colloquium on Structural Information and Communication Complexity, 2018Co-Authors: Johanne Cohen, George Manoussakis, Laurence Pilard, Devan SohierAbstract:This paper presents a new distributed self-stabilizing algorithm solving the maximal matching problem under the fair distributed daemon. This is the first maximal matching algorithm in the Link-Register model under read/write atomicity. This work is composed of two parts. As we cannot establish a move complexity analysis under the fair distributed daemon, we first design an algorithm \(\mathcal A_{1} \) under the unfair distributed daemon dealing with some relaxed constraints on the communication model. Second, we adapt \(\mathcal A_{1} \) so that it can handle the fair distributed daemon, leading to the \(\mathcal A_{2} \) algorithm. We prove that algorithm \(\mathcal A_1\) stabilizes in \(O(m\Delta )\) moves and algorithm \(\mathcal A_2\) in \(O(m\Delta )\) rounds, with \(\Delta \) the maximum degree and m the number of edges.
-
a self stabilizing algorithm for maximal matching in Link Register model in o n delta 3 moves
arXiv: Distributed Parallel and Cluster Computing, 2017Co-Authors: Johanne Cohen, George Manoussakis, Laurence Pilard, Devan SohierAbstract:In the matching problem, each node maintains a pointer to one of its neighbor or to $null$, and a maximal matching is computed when each node points either to a neighbor that itself points to it (they are then called married), or to $null$, in which case no neighbor can also point to $null$. This paper presents a self-stabilizing distributed algorithm to compute a maximal matching in the Link-Register model under read/write atomicity, with complexity {$O(n\Delta^3)$} moves under the adversarial distributed daemon, where $\Delta$ is the maximum degree of the graph.
-
A self-stabilizing algorithm for maximal matching in Link-Register model in $O(n\Delta^3)$ moves
arXiv: Distributed Parallel and Cluster Computing, 2017Co-Authors: Johanne Cohen, George Manoussakis, Laurence Pilard, Devan SohierAbstract:In the matching problem, each node maintains a pointer to one of its neighbor or to $null$, and a maximal matching is computed when each node points either to a neighbor that itself points to it (they are then called married), or to $null$, in which case no neighbor can also point to $null$. This paper presents a self-stabilizing distributed algorithm to compute a maximal matching in the Link-Register model under read/write atomicity, with complexity {$O(n\Delta^3)$} moves under the adversarial distributed daemon, where $\Delta$ is the maximum degree of the graph.
Toshimitsu Masuzawa - One of the best experts on this subject based on the ideXlab platform.
-
Constant Space Self-stabilizing Center Finding Algorithms in Chains and Trees
Parallel Processing Letters, 2020Co-Authors: Yuichi Sudo, Ajoy K. Datta, Lawrence L. Larmore, Toshimitsu MasuzawaAbstract:Self-stabilizing, but non-silent, distributed algorithms, for center finding in chain and tree networks are presented in the Link Register model. We assume that there exists a designated root in a chain and a tree. Under this assumption, both algorithms find the unique center or one of the two centers of the network within O(diam) rounds under the unfair daemon, where diam is the diameter of the network. Both algorithms use constant space, both per process and per Link Register. The basic strategy of the chain algorithm is based on two synchronized waves of different speeds; one wave is three times faster than the other. The tree algorithm uses the fact that a center of the longest path in the tree is also a center of the tree itself. It first finds one of the longest paths in the tree, then finds the unique center or one of the two centers of the path using the chain algorithm.
-
Constant Space Self-stabilizing Center Finding Algorithms in Chains and Trees
Parallel Processing Letters, 2018Co-Authors: Yuichi Sudo, Ajoy K. Datta, Lawrence L. Larmore, Toshimitsu MasuzawaAbstract:Self-stabilizing, but non-silent, distributed algorithms, for center finding in chain and tree networks are presented in the Link Register model. We assume that there exists a designated root in a ...