Detection of stable properties in distributed applications
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Deadlock detection in distributed databases
ACM Computing Surveys (CSUR)
Self-stabilizing deadlock detection algorithms
CSC '92 Proceedings of the 1992 ACM annual conference on Communications
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Detection and resolution of deadlocks in distributed database systems
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Approximation algorithms for directed Steiner problems
Journal of Algorithms
Distributed deadlock detection
ACM Transactions on Computer Systems (TOCS)
An Efficient Distributed Deadlock Avoidance Algorithm for the AND Model
IEEE Transactions on Software Engineering
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Polylogarithmic inapproximability
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A distributed algorithm for detecting resource deadlocks in distributed systems
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A distributed algorithm for generalized deadlock detection
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Approximating Directed Multicuts
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Dynamic deadlock resolution protocols
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Feedback vertex set in mixed graphs
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
| Hi-index | 0.00 |
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 Ω(log2n) 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.