Zobrazeno 1 - 10
of 149
pro vyhledávání: '"Lawrence L. Larmore"'
Publikováno v:
Theoretical Computer Science. 955:113804
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5bce4d79b68ae5639a87a2682bddaaa6
https://doi.org/10.1016/j.tcs.2023.113804
https://doi.org/10.1016/j.tcs.2023.113804
Publikováno v:
Journal of Parallel and Distributed Computing. 146:201-211
Self-stabilizing and silent distributed algorithms for token distribution in rooted tree networks are given. Initially, each process of a graph holds at most l tokens. Our goal is to distribute the tokens uniformly in the whole network so that every
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::920903663228fb7b747c9374cf1b8a53
https://doi.org/10.1016/j.jpdc.2020.07.007
https://doi.org/10.1016/j.jpdc.2020.07.007
Autor:
Ajoy K. Datta, Hirotsugu Kakugawa, Yuichi Sudo, Toshimitsu Masuzawa, Fukuhito Ooshita, Lawrence L. Larmore
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 30:1359-1373
In the population protocol model [Angluin et al. 2006], it is impossible to design a self-stabilizing leader election protocol without any knowledge of the exact number of nodes in the system. The notion of loose-stabilization, which relaxes the clos
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::10c4076c58766ed3d2538030872d4b79
https://doi.org/10.1109/tpds.2018.2881125
https://doi.org/10.1109/tpds.2018.2881125
Publikováno v:
Theoretical Computer Science. 753:35-63
We give a silent self-stabilizing algorithm for the generalized minimal k-dominating set problem in a connected distributed network G. Given a positive integer k and two sets of processes R ⁎ ⊆ D ⁎ , the problem is to find a set D which is mini
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ca239c8d35010fde8a3904f3afb8afd6
https://doi.org/10.1016/j.tcs.2018.06.040
https://doi.org/10.1016/j.tcs.2018.06.040
Publikováno v:
Journal of Parallel and Distributed Computing
Journal of Parallel and Distributed Computing, 2020, 146, pp.79-95. ⟨10.1016/j.jpdc.2020.08.004⟩
Journal of Parallel and Distributed Computing, Elsevier, 2020, 146, pp.79-95. ⟨10.1016/j.jpdc.2020.08.004⟩
Journal of Parallel and Distributed Computing, 2020, 146, pp.79-95. ⟨10.1016/j.jpdc.2020.08.004⟩
Journal of Parallel and Distributed Computing, Elsevier, 2020, 146, pp.79-95. ⟨10.1016/j.jpdc.2020.08.004⟩
International audience; We study leader election in unidirectional rings of homonyms that have no a priori knowledge of the number of processes. In this context, we show that there exists no algorithm that solves the process-terminating leader electi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::872a6f387934e4f09116f8378909ad1a
https://uca.hal.science/hal-03452675/document
https://uca.hal.science/hal-03452675/document
Autor:
Ajoy K. Datta, Lawrence L. Larmore
Publikováno v:
Theory of Computing Systems. 62:977-1047
Two silent self-stabilizing asynchronous distributed algorithms are given for the leader election problem in a dynamic network with unique IDs. A leader is elected for each connected component of the network. A BFS DAG, rooted at the leader, is const
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7643e9bc895b6e61b5c79f1eed8f2d8e
https://doi.org/10.1007/s00224-017-9758-9
https://doi.org/10.1007/s00224-017-9758-9
Publikováno v:
Theoretical Computer Science. 665:51-72
In this paper, we give a distributed silent self-stabilizing algorithm, DISJ, for the disjunction problem in a connected network. In this problem, each process x has an input bit x.in, assigned by the application layer, and each process must compute
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::826dc04f6bf288d74063a7fa6f7af108
https://doi.org/10.1016/j.tcs.2016.12.012
https://doi.org/10.1016/j.tcs.2016.12.012
Publikováno v:
21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2019)
21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2019), Oct 2019, Pise, Italy. pp.99-104, ⟨10.1007/978-3-030-34992-9_8⟩
Lecture Notes in Computer Science ISBN: 9783030349912
SSS
21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2019), Oct 2019, Pise, Italy. pp.99-104, ⟨10.1007/978-3-030-34992-9_8⟩
Lecture Notes in Computer Science ISBN: 9783030349912
SSS
We present preliminary results on the last topic we collaborate with our late friend, Professor Ajoy Kumar Datta (1958–2019), who prematurely left us a few months ago. In this work, we shed new light on a self-stabilizing wave algorithm proposed by
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e4d5ccb1ecbcf0e3a1dbc911ee5d84a2
https://hal.archives-ouvertes.fr/hal-02489447
https://hal.archives-ouvertes.fr/hal-02489447
Publikováno v:
ICDCN
We consider the minimal k-grouping problem: given a graph G=(V,E) and a constant k, partition G into subgraphs of diameter no greater than k, such that the union of any two subgraphs has diameter greater than k. We give a silent self-stabilizing asyn
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f1c66401d04152605d27e0bc554911c3
http://arxiv.org/abs/1907.10803
http://arxiv.org/abs/1907.10803
Publikováno v:
Information Processing Letters. 161:105979
In this paper, we consider the all best swap edges problem in a distributed environment. We are given a 2-edge connected positively weighted network X, where all communication is routed through a rooted spanning tree T of X. If one tree edge \(e={\le
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::17826227247e5c969ab4ad7ca9263c96
https://doi.org/10.1016/j.ipl.2020.105979
https://doi.org/10.1016/j.ipl.2020.105979