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 failure-oblivious services are allowed.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Gilbert, S., Lynch, N.: Brewer’s conjecture and the feasibility of consistent, available, partition-tolerant web services. ACM SIGACT News 33(2), 51–59 (2002)
Attie, P., et al.: The Impossibility of Boosting Distributed Service Resilience (Extended abstract). In: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (ICDCS2005), pp. 39–48 (2005), the full version is available at http://theory.lcs.mit.edu/tds/papers/Attie/boosting-tr.ps
Fischer, M., et al.: Impossibility of distributed consensus with one faulty process. Journal of the ACM 32(3), 374–382 (1985)
Herlihy, M.: Wait-free synchronization. ACM Transactions on Programming Languages and Systems 13(1), 124–149 (1991)
Jayanti, P.: On the robustness of Herlihy’s hierarchy. In: Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing (PODC1993), pp. 145–157 (1993)
Lynch, N.: Distributed Algorithms. Morgan Kaufmann Publishers, San Francisco (1996)
Herlihy, M., Shavit, N.: The topological structure of asynchronous computability. Journal of the ACM 46(6), 858–923 (1999)
Saks, M., Zaharoglou, F.: Wait-free k-set agreement is impossible: The topology of public knowledge. SIAM Journal on Computing 29, 1449–1483 (2000)
Herlihy, M., Rajsbaum, S.: Set Consensus Using Arbitrary Objects. In: Proceedings of 13th Annual ACM Symposium on Principles of Distributed Computing (PODC 1994), pp. 324–333 (1994)
Afek, Y., et al.: Computing with Faulty Shared Memory. In: Proceedings of 13th Annual ACM Symposium on Principles of Distributed Computing (PODC 1992), pp. 47–58 (1992)
Jayanti, P., et al.: Fault-Tolerant Wait-Free Shared Objects. Journal of the ACM 45(3), 451–500 (1998)
Liu, X., et al.: Revisiting the Impossibility for Boosting Service Resilience. Technical report (January 1998), Available at http://blog.software.ict.ac.cn/xliu/files/2007/03/RevisitingtheImpossibilityforBoostingServiceResilience-full.pdf
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, X., Xu, Z., Pu, J. (2007). Revisiting the Impossibility for Boosting Service Resilience. In: Cai, JY., Cooper, S.B., Zhu, H. (eds) Theory and Applications of Models of Computation. TAMC 2007. Lecture Notes in Computer Science, vol 4484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72504-6_65
Download citation
DOI: https://doi.org/10.1007/978-3-540-72504-6_65
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72503-9
Online ISBN: 978-3-540-72504-6
eBook Packages: Computer ScienceComputer Science (R0)