Abstract
We investigate the impossibility of solving certain problems in an unreliable distributed system where multiple processes may fail. We assume undetectable crash failures which means that a process may become faulty at any time during an execution and that no event can happen on a process after it fails. A sufficient condition is provided for the unsolvability of problems in the presence of multiple faulty processes. Several problems are shown to be solvable in the presence of t − 1 faulty processes but not in the presence of t faulty processes for any t. These problems are variants of problems which are unsolvable in the presence of a single faulty process (such as consensus, choosing a leader, ranking, matching). In order to prove the impossibility result a contradiction is shown among a set of axioms which characterize any fault-tolerant protocol solving the problems we treat. In the course of the proof, we present two results that appear to be of independent interest: first, we show that for any protocol there is a computation in which some process is a splitter. This process can split the possible outputs of the protocol to two disjoint sets. In case that the protocol is also fault-tolerant, then this splitter must be a decider, that can split its own output values into two different singletons. These results generalize and expand known results for asynchronous systems.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
(Preliminary Version).
Supported in part by the National Science Foundation under grant DCR-8405478, by the Hebrew Technical Institute scholarship, and by the Guttwirth Fellowship.
Supported in part by Technion V.P.R. Funds — Wellner Research Fund, and by the Foundation for Research in Electronics, Computers and Communications, administrated by the Israel Academy of Sciences and Humanities.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Attiya, H., Bar-Noy, A., Dolev, D., Koller, D., Peleg, D., and Reischuk, R. Achievable cases in an asynchronous environment, ACM-FOCS 1987, 337–346.
Biran, O., Moran S., and Zaks, S. A Combinatorial characterization of the distributed tasks which are solvable in the presence of one faulty processor, ACM-PODC 1988, 263–275.
Bridgland, M., and Watro, R. Fault-tolerant decision making in totally asynchronous distributed systems, ACM-PODC 1987, 52–63.
Chandy, M., and Misra, J. On the nonexistence of robust commit protocols, Unpublished manuscript, November 1985.
Chandy, M., and Misra, J. How processes learn, Distributed Computing 1986, 40–52.
Dolev, D., Dwork, C., Stockmeyer, L. On the minimal synchronism needed for distributed consensus, JACM 34, 1, 1987, 77–97.
Dwork, C., Lynch, N., Stockmeyer, L. Consensus in the presence of partial synchrony, JACM 35, 2, 1988, 288–323.
Even, S., Selman A., and Yacobi, Y. The complexity of promise problems with applications to public-key cryptography, Information and Control 1984, 159–173.
Fischer, M., Lynch, N., Paterson, M. Impossibility of distributed consensus with one faulty process, JACM 32, 2, 1985, 374–382.
Moran, S., and Wolfstahl, Y. An extended impossibility result for asynchronous complete networks, IPL 26, November 1987, 145–151.
Taubenfeld, G. Impossibility Results for Decision Protocols, Technion Technical Report #445, January 1987. Revised version, Technion TR #506, April 1988.
Taubenfeld, G., Katz, S., and Moran, S. Impossibility results in the presence of multiple faulty processes, Technion Technical Report #492, January 1988.
Taubenfeld, G., Katz, S., and Moran, S. Initial failures in distributed computations, Technion Technical Report #517, August 1988.
Taubenfeld, G., and Moran, S. Possibility and impossibility results in a shared memory environment, To appear in 3rd International workshop on distributed algorithms, Nice, France, September 1989. Also, Yale technical report YALEU/DCS/TR-708 (May 1989).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Taubenfeld, G., Katz, S., Moran, S. (1989). Impossibility results in the presence of multiple faulty processes. In: Veni Madhavan, C.E. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1989. Lecture Notes in Computer Science, vol 405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52048-1_37
Download citation
DOI: https://doi.org/10.1007/3-540-52048-1_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52048-1
Online ISBN: 978-3-540-46872-1
eBook Packages: Springer Book Archive