Abstract
In this paper we initiate the study of the AND-OR directed feedback vertex set problem from the viewpoint of approximation algorithms. This AND-OR feedback vertex set problem is motivated by a practical deadlock resolution problem that appears in the development of distributed database systems. This problem also turns out be a natural generalization of the directed feedback vertex set problem. Awerbuch and Micali [1] gave a polynomial time algorithm to find a minimal solution for this problem. Unfortunately, a minimal solution can be arbitrarily more expensive than the minimum cost solution. We show that finding the minimum cost solution is as hard as the directed Steiner tree problem (and thus Ω(log 2 n) hard to approximate). On the positive side, we give algorithms which work well when the number of writers (AND nodes) or the number of readers (OR nodes) are small.
We also consider a variant that we call permanent deadlock resolution where we cannot specify an execution order for the surviving processes; they should get completed even if they were scheduled adversarially. When all processes are writers (AND nodes), we give an O(log n log log n) approximation for this problem.
Finally we give an LP-rounding approach and discuss some other natural variants.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Awerbuch, B., Micali, S.: Dynamic deadlock resolution protocols. In: The 27th Annual Symposium on Foundations of Computer Science, pp. 196–207 (1986)
Bar-Yehuda, R., Geiger, D., Naor, J., Roth, R.M.: Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and Bayesian inference. SIAM J. Comput. 27, 942–959 (1998)
Bracha, G., Toueg, S.: A distributed algorithm for generalized deadlock detection. In: Proceedings of the 3rd annual ACM symposium on Principles of distributed computing, pp. 285–301. ACM Press, New York (1984)
Chandy, K.M., Lamport, L.: Distributed snapshots: determining global states of distributed systems. ACM Transactions on Computer Systems (TOCS) 3, 63–75 (1985)
Chandy, K.M., Misra, J.: A distributed algorithm for detecting resource deadlocks in distributed systems. In: Proceedings of the 1st ACM SIGACT-SIGOPS symposium on Principles of distributed computing, pp. 157–164. ACM Press, New York (1982)
Chandy, K.M., Misra, J., Haas, L.M.: Distributed deadlock detection. ACM Transactions on Computer Systems (TOCS) 1, 144–156 (1983)
Charikar, M., Chekuri, C., Cheung, T.-y., Dai, Z., Goel, A., Guha, S., Li, M.: Approximation algorithms for directed Steiner problems. J. Algorithms 33, 73–91 (1999)
Cheriyan, J., Karloff, H.J., Rabani, Y.: Approximating directed multicuts. In: The 42th Annual Symposium on Foundations of Computer Science, pp. 348–356 (2001)
Even, G., Naor, J., Schieber, B., Sudan, M.: Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica 20, 151–174 (1998)
Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45, 634–652 (1998)
Flatebo, M., Datta, A.K.: Self-stabilizing deadlock detection algorithms. In: Proceedings of the 1992 ACM annual conference on Communications, pp. 117–122. ACM Press, New York (1992)
Gray, J., Homan, P., Obermarck, R., Korth, H.: A straw man analysis of probability of waiting and deadlock. In: Proceedings of the 5th Internafional Conference on Distributed Data Management and Computer Networks (1981)
Halperin, E., Krauthgamer, R.: Polylogarithmic inapproximability. In: The 35th Annual ACM Symposium on Theory of Computing (STOC 2003), pp. 585–594 (2003)
Helary, J.-M., Jard, C., Plouzeau, N., Raynal, M.: Detection of stable properties in distributed applications. In: Proceedings of the 6th PODC, pp. 125–136. ACM Press, New York (1987)
Herman, T., Chandy, K.M.: A distributed procedure to detect and/or deadlock, Tech. Rep. TR LCS-8301, Dept. of Computer Sciences, Univ. of Texas (1983)
Jain, K., Mahdian, M., Salavatipour, M.R.: Packing Steiner trees. In: The 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), pp. 266–274 (2003)
Knapp, E.: Deadlock detection in distributed databases. ACM Computing Surveys (CSUR) 19, 303–328 (1987)
Leighton, T., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM 46, 787–832 (1999)
Lipton, R.J., Tarjan, R.E.: Applications of a planar separator theorem. SIAM J. Comput. 9, 615–627 (1980)
Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. J. Assoc. Comput. Mach. 41, 960–981 (1994)
Makki, K., Pissinou, N.: Detection and resolution of deadlocks in distributed database systems. In: Proceedings of the 4th international conference on Information and knowledge management, pp. 411–416. ACM Press, New York (1995)
Seymour, P.D.: Packing directed circuits fractionally. Combinatorica 15, 281–288 (1995)
Wu, H., Chin, W.-N., Jaffar, J.: An efficient distributed deadlock avoidance algorithm for the and model. IEEE Transactions on Software Engineering 28, 18–29 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jain, K., Hajiaghayi, M., Talwar, K. (2005). The Generalized Deadlock Resolution Problem. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds) Automata, Languages and Programming. ICALP 2005. Lecture Notes in Computer Science, vol 3580. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11523468_69
Download citation
DOI: https://doi.org/10.1007/11523468_69
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27580-0
Online ISBN: 978-3-540-31691-6
eBook Packages: Computer ScienceComputer Science (R0)