Back to Search
Start Over
A New Insight into Local Coin-Based Randomized Consensus
- Source :
- PRDC 2019-24th IEEE Pacific Rim International Symposium on Dependable Computing, PRDC 2019-24th IEEE Pacific Rim International Symposium on Dependable Computing, Dec 2019, Kyoto, Japan. pp.207-216, ⟨10.1109/PRDC47002.2019.00051⟩, PRDC
- Publication Year :
- 2019
- Publisher :
- HAL CCSD, 2019.
-
Abstract
- This paper presents a binary randomized consensus algorithm for n-process asynchronous message-passing systems in which (1) up to t O(sqrt(n)) it is no longer possible to implement a randomized consensus algorithm ensuring a constant number of communication steps despite unfair channels.
- Subjects :
- Consensus algorithm
021110 strategic, defence & security studies
Theoretical computer science
Computer science
0211 other engineering and technologies
Binary number
Process crash failure
0102 computer and information sciences
02 engineering and technology
Binary consensus
Local coin
01 natural sciences
Message- passing asynchronous system
010201 computation theory & mathematics
Asynchronous communication
[INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]
Constant (mathematics)
Condition
ComputingMilieux_MISCELLANEOUS
Subjects
Details
- Language :
- English
- Database :
- OpenAIRE
- Journal :
- PRDC 2019-24th IEEE Pacific Rim International Symposium on Dependable Computing, PRDC 2019-24th IEEE Pacific Rim International Symposium on Dependable Computing, Dec 2019, Kyoto, Japan. pp.207-216, ⟨10.1109/PRDC47002.2019.00051⟩, PRDC
- Accession number :
- edsair.doi.dedup.....c41a97fdf43e71f52796cba284113b56
- Full Text :
- https://doi.org/10.1109/PRDC47002.2019.00051⟩