loading...
The Impossibility of Boosting Resilience of Fully-connected Services for Solving Set-consensus Tasks
July 07-July 11
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SCC.2008.292008 IEEE International Conference on ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
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.
Citation:
Juhua Pu, Zhang Xiong, Xingwu Liu, "The Impossibility of Boosting Resilience of Fully-connected Services for Solving Set-consensus Tasks," scc, vol. 2, pp.599-600, 2008 IEEE International Conference on Services Computing Vol. 2, 2008
Usage of this product signifies your acceptance of the Terms of Use.