Revisiting the impossibility for boosting service resilience

Authors:
Xingwu Liu;Zhiwei Xu;Juhua Pu
Affiliations:
Research Center for Grid and Service Computing, Institute of Computing Technology, Chinese Academy of Sciences;Research Center for Grid and Service Computing, Institute of Computing Technology, Chinese Academy of Sciences;School of Computer Science, BeiHang University
Venue:
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Year:
2007

Citing 11
Cited 0

Wait-free synchronization

ACM Transactions on Programming Languages and Systems (TOPLAS)
Computing with faulty shared memory

PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
On the robustness of Herlihy's hierarchy

PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Set consensus using arbitrary objects (preliminary version)

PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
Fault-tolerant wait-free shared objects

Journal of the ACM (JACM)
The topological structure of asynchronous computability

Journal of the ACM (JACM)
Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge

SIAM Journal on Computing
Distributed Algorithms

Distributed Algorithms
Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services

ACM SIGACT News
The Impossibility of Boosting Distributed Service Resilience

ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

An asynchronous distributed system consisting of a collection of processes interacting via accessing shared services or variables. Failure-tolerant computability for such systems is an important issue, but too little attention has been paid to the case where the services themselves can fail. Recently, it's proved that consensus problem can't be (f +1)-resiliently solved using a finite number of reliable registers and f -resilient services (failure-aware services must be fully connected). We generalize the result in two dimensions. Firstly, it's shown that the impossibility holds even if infinitely many registers and services are allowed. Secondly, we prove that replacing the reliable registers with reliable shared variables still leave the impossibility to hold, if only failureoblivious services are allowed.