Name
Title | ||
|---|---|---|
The Impossibility of Boosting Resilience of Fully-connected Services for Solving Set-consensus Tasks |
Abstract | ||
|---|---|---|
This paper explores whether (n-2)-resilient services and reliable registers can wait-free solve (n, n-1)-consensus. It has already been shown to be feasible if arbitrary connection is allowed, while we prove that it's impossible otherwise. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/SCC.2008.29 | IEEE SCC (2) |
Keywords | Field | DocType |
arbitrary connection,resilient service,boosting resilience,reliable register,fully-connected services,set-consensus tasks,terminology,computability,distributed system,computer science,communication channels,distributed algorithms,boosting,fault tolerance,testing,registers,resilience | Psychological resilience,Terminology,Computer science,Communication channel,Computability,Impossibility,Theoretical computer science,Distributed algorithm,Fault tolerance,Boosting (machine learning),Distributed computing | Conference |
ISSN | Citations | PageRank |
2474-8137 | 0 | 0.34 |
References | Authors | |
6 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Juhua Pu | 1 | 50 | 11.90 |
| Zhang Xiong | 2 | 13 | 1.85 |
| Xingwu Liu | 3 | 19 | 12.77 |