Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Mouna Safir"'
In this article, we investigate the solvability of $k$-set agreement among $n$ processes in distributed systems prone to different types of process failures. Specifically, we explore two scenarios: synchronous message-passing systems prone to up to $
Externí odkaz:
http://arxiv.org/abs/2310.01976
Publikováno v:
SSS 2022-24th International Symposium on Stabilizing, Safety, and Security of Distributed Systems
SSS 2022-24th International Symposium on Stabilizing, Safety, and Security of Distributed Systems, Nov 2022, Clermont-Ferrand, France. pp.178-192, ⟨10.1007/978-3-031-21017-4_12⟩
Lecture Notes in Computer Science ISBN: 9783031210167
SSS 2022-24th International Symposium on Stabilizing, Safety, and Security of Distributed Systems, Nov 2022, Clermont-Ferrand, France. pp.178-192, ⟨10.1007/978-3-031-21017-4_12⟩
Lecture Notes in Computer Science ISBN: 9783031210167
International audience
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4690df698c572fe2a44c68e82d4bc0b2
https://inria.hal.science/hal-03920733
https://inria.hal.science/hal-03920733
Publikováno v:
Networked Systems ISBN: 9783030670863
NETYS
NETYS
In the k-set agreement, each process must decide on a value in such a way that no more than k different values are decided by the processes. The case where \(k=1\) corresponds to the consensus problem. For both theoretical (possibility and impossibil
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9d8e2f77f5bb860fcab0c58b6c984bea
https://doi.org/10.1007/978-3-030-67087-0_12
https://doi.org/10.1007/978-3-030-67087-0_12