Abstract
We present a use of graph-theoretic concepts in fault-tolerant distributed systems.
The question of which distributed tasks can be solved by asynchronous protocols in the presence of crash failures has been investigated in recent years. Some of these studies investigate the solvability of specific tasks, providing both positive and negative results.
Given a distributed task, we associate with it certain graphs, that enable us to determine whether this task can be solved in the presence of on faulty processor ([BMZ]), and in this paper we further use this approach to study the following problem: Given a task T for N processors, how difficult is it to determine whether T can be solved in the presence of one faulty processor? We show that this problem is NP-hard for any fixed N≥3.
(Extended Abstract)
This research was supported in part by Technion V.P.R. Funds — Wellner Research Fund and Loewengart Research Fund, by the I. Goldberg Fund for Electronics Research, 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 to check access.
Preview
Unable to display preview. Download preview PDF.
References
C. Attiya, A. Bar-Noy, D. Dolev, D. Koller, D. Peleg, R. Reischuk "Achievable cases in an asynchronous environment", Proc. of the 28th FOCS, October 1987, pp. 337–346.
O. Biran, S. Moran and S. Zaks, "A combinatorial characterization of the distributed tasks which are solvable in the presence of one faulty processor", Proc. of the 7th PODC, 1988, pp. 263–273.
D. Dolev, N. A. Lynch, S. Pinter, E. Stark and W. Weihl, "Reaching approximate agreement in the presence of faults", Journal of the ACM, Vol. 33 no. 3 (1986), pp. 499–516.
M. J. Fischer, N. A. Lynch and M. S. Paterson, "Impossibility of distributed consensus with one faulty process", Journal of the ACM, Vol. 32 No. 2 (1985), pp. 373–382.
R. M. Karp, "Reducibility among combinatorial problems", in R. E. Miller and J. W. Thatcher (eds.), Complexity of computer computations, Plenum Press, NY (1972), pp. 85–103.
S. Moran and Y. Wolfstahl, "Extended impossibility results for asynchronous complete networks" Information Processing Letters 26, 1987/88, pp. 145–151.
G. Neiger and S. Toueg, "Automatically increasing the Faulttolerance of distributed systems", Proc. of the 7th PODC, 1988, pp. 248–262.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Biran, O., Moran, S., Zaks, S. (1991). Deciding 1-solvability of distributed task is NP-hard. In: Möhring, R.H. (eds) Graph-Theoretic Concepts in Computer Science. WG 1990. Lecture Notes in Computer Science, vol 484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53832-1_44
Download citation
DOI: https://doi.org/10.1007/3-540-53832-1_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53832-5
Online ISBN: 978-3-540-46310-8
eBook Packages: Springer Book Archive