DocumentCode
2299220
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
Volume
2
fYear
2008
fDate
7-11 July 2008
Firstpage
599
Lastpage
600
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;
fLanguage
English
Publisher
ieee
Conference_Titel
Services Computing, 2008. SCC '08. IEEE International Conference on
Conference_Location
Honolulu, HI
Print_ISBN
978-0-7695-3283-7
Type
conf
DOI
10.1109/SCC.2008.29
Filename
4578591
Link To Document