Zobrazeno 1 - 10
of 135
pro vyhledávání: '"Métivier, Yves"'
This paper revisits two classical distributed problems in anonymous networks, namely spanning tree construction and topology recognition, from the point of view of graph covering theory. For both problems, we characterize necessary and sufficient con
Externí odkaz:
http://arxiv.org/abs/2101.01409
We consider networks of processes which interact with beeps. In the basic model defined by Cornejo and Kuhn (2010), processes can choose in each round either to beep or to listen. Those who beep are unable to detect simultaneous beeps. Those who list
Externí odkaz:
http://arxiv.org/abs/1607.02951
Leader election is, together with consensus, one of the most central problems in distributed computing. This paper presents a distributed algorithm, called \STT, for electing deterministically a leader in an arbitrary network, assuming processors hav
Externí odkaz:
http://arxiv.org/abs/1605.01903
Contrary to the sequential world, the processes involved in a distributed system do not necessarily know when a computation is globally finished. This paper investigates the problem of the detection of the termination of local computations. We define
Externí odkaz:
http://arxiv.org/abs/1001.2785
Autor:
Courcelle, Bruno, Métivier, Yves
We study unfoldings of directed graphs and coverings of undirected ones, so as to highlight the similarities between the two notions. We generalize them by attaching finite or infinite weights to edges. Complete unfoldings and universal coverings of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6e891245f7f903361b38cbde7ec9c6c9
https://hal.archives-ouvertes.fr/hal-02559494
https://hal.archives-ouvertes.fr/hal-02559494
Publikováno v:
In Information and Computation 2005 198(1):40-55
Publikováno v:
Algorithmica
Algorithmica, Springer Verlag, 2019, 81 (5), pp.1901-1920. ⟨10.1007/s00453-018-0517-3⟩
Algorithmica, Springer Verlag, 2019, 81 (5), pp.1901-1920. ⟨10.1007/s00453-018-0517-3⟩
International audience; Leader election is, together with consensus, one of the most central problems in distributed computing. This paper presents a distributed algorithm, called ST T , for electing deterministically a leader in an arbitrary network
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::0fb4099a65591b4d423d9bab0c1f12de
https://hal.archives-ouvertes.fr/hal-01883355/document
https://hal.archives-ouvertes.fr/hal-01883355/document
Publikováno v:
In Information and Computation 2003 184(1):109-128
We consider networks of processes which interact with beeps. In the basic model defined by Cornejo and Kuhn, which we refer to as the BL variant, processes can choose in each round either to beep or to listen. Those who beep are unable to detect simu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::82ab5ebbb236cbfb300a594cf10f69a3
Publikováno v:
Fundamenta Informaticae. 2012, Vol. 120 Issue 1, p1-27. 27p. 2 Diagrams.