Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Laurence Pilard"'
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2019, 782, pp.54-78. ⟨10.1016/j.tcs.2019.02.031⟩
Theoretical Computer Science, Elsevier, 2019, 782, pp.54-78. ⟨10.1016/j.tcs.2019.02.031⟩
We present the first polynomial self-stabilizing algorithm for finding a 1-maximal matching in a general graph. The previous best known algorithm has been presented by Manne et al. [20] and we show in this paper it has a sub-exponential time complexi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f731b15e3c22225164d0112af0574b4b
https://doi.org/10.1016/j.tcs.2019.02.031
https://doi.org/10.1016/j.tcs.2019.02.031
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030910808
SSS
SSS
We analyze the impact of transient and Byzantine faults on the construction of a maximal independent set in a general network. We adapt the self-stabilizing algorithm presented by Turau [15] for computing such a vertex set. Our algorithm is self-stab
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::37e4bdf34bdd5523fe0640be8fdaab14
https://doi.org/10.1007/978-3-030-91081-5_33
https://doi.org/10.1007/978-3-030-91081-5_33
Publikováno v:
tabilization, Safety, and Security of Distributed Systems. SSS 2018
tabilization, Safety, and Security of Distributed Systems. SSS 2018, Nov 2018, Tokyo, Japan. pp.80-95, ⟨10.1007/978-3-030-03232-6_6⟩
Lecture Notes in Computer Science ISBN: 9783030032319
SSS
tabilization, Safety, and Security of Distributed Systems. SSS 2018, Nov 2018, Tokyo, Japan. pp.80-95, ⟨10.1007/978-3-030-03232-6_6⟩
Lecture Notes in Computer Science ISBN: 9783030032319
SSS
We analyse the impact of transient and Byzantine faults on the construction of a maximal matching in a general network. We consider the self-stabilizing algorithm called AnonyMatch presented by Cohen et al. [3] for computing such a matching. Since se
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::38a3ff329626ec3a8ab49027b5398b77
https://hal.archives-ouvertes.fr/hal-01974902
https://hal.archives-ouvertes.fr/hal-01974902
Publikováno v:
SIROCCO 2018: International Colloquium on Structural Information and Communication Complexity
SIROCCO 2018: International Colloquium on Structural Information and Communication Complexity, Jun 2018, Ma'ale HaHamisha, Israel. pp.14-19
Structural Information and Communication Complexity ISBN: 9783030013240
SIROCCO
SIROCCO 2018: International Colloquium on Structural Information and Communication Complexity, Jun 2018, Ma'ale HaHamisha, Israel. pp.14-19
Structural Information and Communication Complexity ISBN: 9783030013240
SIROCCO
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b1f777519294454d186d1af2dfc3c6c1
https://hal.archives-ouvertes.fr/hal-01974891
https://hal.archives-ouvertes.fr/hal-01974891
Autor:
Janna Burman, Johanne Cohen, Laurence Pilard, Marie Laveau, George Manoussakis, Thibault Bernard, Joffroy Beauquier
Publikováno v:
International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)
International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2017, Boston, United States. pp.46-61, ⟨10.1007/978-3-319-69084-1_4⟩
Lecture Notes in Computer Science ISBN: 9783319690834
SSS
International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2017, Boston, United States. pp.46-61, ⟨10.1007/978-3-319-69084-1_4⟩
Lecture Notes in Computer Science ISBN: 9783319690834
SSS
International audience; Stable matching (also called stable marriage in the literature) is a problem of matching in a bipartite graph, introduced in an economic context by Gale and Shapley. In this problem, each node has preferences for matching with
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a4c235ed4c1ac11e0bc3146068e62173
https://hal.archives-ouvertes.fr/hal-01576055/document
https://hal.archives-ouvertes.fr/hal-01576055/document
Publikováno v:
Parallel Processing Letters
Parallel Processing Letters, World Scientific Publishing, 2016, 26 (04), ⟨10.1142/S012962641650016X⟩
Parallel Processing Letters, World Scientific Publishing, 2016, Parallel Processing Letters, 26, ⟨10.1142/S012962641650016X⟩
Parallel Processing Letters, 2016, Parallel Processing Letters, 26, ⟨10.1142/S012962641650016X⟩
Parallel Processing Letters, World Scientific Publishing, 2016, 26 (04), ⟨10.1142/S012962641650016X⟩
Parallel Processing Letters, World Scientific Publishing, 2016, Parallel Processing Letters, 26, ⟨10.1142/S012962641650016X⟩
Parallel Processing Letters, 2016, Parallel Processing Letters, 26, ⟨10.1142/S012962641650016X⟩
We propose a self-stabilizing algorithm for computing a maximal matching in an anonymous network. The complexity is O(2) moves with high probability, under the adversarial distributed daemon. Among all adversarial distributed daemons and with the ano
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d65c55a8036caba596859e264896bada
https://hal.archives-ouvertes.fr/hal-01758046
https://hal.archives-ouvertes.fr/hal-01758046
Publikováno v:
Theoretical Computer Science. 412:5515-5526
The matching problem asks for a large set of disjoint edges in a graph. It is a problem that has received considerable attention in both the sequential and the self-stabilizing literature. Previous work has resulted in self-stabilizing algorithms for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3c25616b11d4487be8b37e4031224ea3
https://doi.org/10.1016/j.tcs.2011.05.019
https://doi.org/10.1016/j.tcs.2011.05.019
Publikováno v:
Cluster Computing. 15:335-350
We propose an algorithm that builds and maintains clusters over a network subject to mobility. This algorithm is fully decentralized and makes all the different clusters grow concurrently. The algorithm uses circulating tokens that collect data and m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::abe0d2ee3ca45c9e7e19ff19d26d6810
https://doi.org/10.1007/s10586-011-0153-z
https://doi.org/10.1007/s10586-011-0153-z
Autor:
Darius Buntinas, Thomas Herault, Ala Rezmerita, Laurence Pilard, Eric Rodriguez, Camille Coti, Franck Cappello, Pierre Lemarinier
Publikováno v:
Future Generation Computer Systems. 24:73-84
A long-term trend in high-performance computing is the increasing number of nodes in parallel computing platforms, which entails a higher failure probability. Fault tolerant programming environments should be used to guarantee the safe execution of c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::229bd85f63a5b3a9ba9dc904c6842ccb
https://doi.org/10.1016/j.future.2007.02.002
https://doi.org/10.1016/j.future.2007.02.002
Publikováno v:
Journal of Aerospace Computing, Information, and Communication. 3:516-537
A self-stabilizing algorithm cannot detect by itself that stabilization has been reached. For overcoming this drawback Lin and Simon introduced the notion of an external observer: a set of processes, one being located at each node, whose role is to d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5c7c04e7a8e64f6ec7780176210174bc
https://doi.org/10.2514/1.19858
https://doi.org/10.2514/1.19858