Title :
The Impossibility of Boosting Resilience of Fully-connected Services for Solving Set-consensus Tasks
Author :
Pu, Juhua ; Xiong, Zhang ; Liu, Xingwu
Author_Institution :
Sch. of Comput. Sci., Beihang Univ., Beijing
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.
Keywords :
computability; distributed algorithms; computability; distributed system; fully-connected services; reliable register; resilient services; set-consensus task; Boosting; Communication channels; Computer science; Delay; Fault tolerance; Maintenance; Registers; Resilience; Terminology; Testing;
Conference_Titel :
Services Computing, 2008. SCC '08. IEEE International Conference on
Conference_Location :
Honolulu, HI
Print_ISBN :
978-0-7695-3283-7
DOI :
10.1109/SCC.2008.29
