Abstract
We investigate the possibility of solving problems in completely asynchronous message passing systems where a number of processes may fail prior to execution. By using game-theoretical notions, necessary and sufficient conditions are provided for solving problems is such a model with an without a termination requirement. An upper bound on the message complexity for solving any problem in the model is given, as well as a simple design concept for constructing a solution to any solvable problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Fischer, N. Lynch, and M. Paterson, Impossibility of distributed consensus with one faulty process,JACM 32(2):374–382 (1985).
R. Bar-Yehuda, S. Kutten, Y. Wolfstahl, and S. Zaks, Making distributed spanning tree algorithms fault-resilient,STACS 87, LNCS No. 247, pp. 432–445.
H. Abu-Amara, Fault-Tolerant distributed algorithm for election in computer network,IEEE Transactions on Computers,37(4):449–453 (April 1988).
D. Dolev, C. Dwork, and L. Stockmeyer, On the minimal synchronism needed for distributed consensus,JACM 34(1):77–97 (1987).
C. Dwork, N. Lynch, and L. Stockmeyer, Consensus in the presence of partial synchrony,JACM 35(2):288–323 (1988).
S. Moran and Y. Wolfstahl, An extended impossibility result for asynchronous complete networks,IPL 26:145–151 (November, 1987).
G. Taubenfeld, Impossibility Results for Decision Protocols, Technion Technical Report #445 (January 1987). Revised version, Technion Technical Report #506 (April 1988).
O. Biran, S. Moran, and S. Zaks, A Combinatorial characterization of the distributed taks which are solvable in the presence of one faulty processor,ACM-PODC (1988).
H. Attiya, A. Bar-Noy, D. Dolev, D. Koller, D. Peleg, and R. Reischuk, Achievable cases in an asynchronous environment,IEEE-FOCS, pp. 337–346 (1987).
M. Bridgland and R. Watro, Fault-tolerant decision making in totally asynchronous distributed systems,ACM-PODC, pp. 52–63 (1987).
G. Taubenfeld, S. Katz, and S. Moran, Impossibility Results in the presence of multiple faulty processes, Technion Technical Report #492 (January 1988). Also, in theProceeding of the 9th FCT-TCS Conference, Bangalore, India (December 1989).
B. Chor and L. Moscovici, Solvability in asynchronous environments,IEEE-FOCS, pp. 422–427 (1989).
G. Taubenfeld and S. Moran, Possibility and impossibility results in a shared memory environment,Proceedings of the 3rd International Workshop on Distributed Algorithms, Nice, France (September 1989). In:LNCS 392, eds., J. C. Bermond and M. Raynal, Springer Verlag (1989).
M. Chandy and J. Misra, On the nonexistence of robust commit protocols, Unpublished manuscript (November 1985).
M. Chandy and J. Misra, How processes learn,Distributed Computing, pp. 40–52 (1986).
V. Hadzilacos, A knowledge theoretic analysis of atomic commitment protocols,ACM-PODS, pp. 129–134 (1987).
H. Ebbinghaus, J. Flum, and W. Thomas, Mathematical Logic, Springer-Verlag (1984).
E. Korach, S. Moran, and S. Zaks, Tight lower and upper bounds for some distributed algorithms for a complete network of processors,ACM-PODC, pp. 199–207 (1984).
R. Koo and S. Toueg, Effects of message loss on the termination of distributed protocols,IPL 27:181–188 (April 1988).
G. Moran, personal communication.
Author information
Authors and Affiliations
Additional information
Supported in part by the Guttwirth Fellowship, by the National Science Foundation under grant CCR-8405478, and by the Hebrew Technical Institute scholarship.
Supported in part by Technion V.P.R. fund—C. Wellner Research fund.
Rights and permissions
About this article
Cite this article
Taubenfeld, G., Katz, S. & Moran, S. Initial failures in distributed computations. Int J Parallel Prog 18, 255–276 (1989). https://doi.org/10.1007/BF01407859
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01407859