The generalized deadlock resolution problem

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 853-865

  Jain, Kamal ^a   Hajiaghayi, MohammadTaghi ^b   Talwar, Kunal ^a  

^a MICROSOFT RESEARCH   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; LOGIC GATES; PROBLEM SOLVING; TREES (MATHEMATICS);

AND NODES; APPROXIMATION ALGORITHMS; FEEDBACK VERTEX;

COMPUTER SCIENCE;

EID: 26444541677     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_69     Document Type: Conference Paper

References (23)

1. B. AWERBUCH AND S. MICALI, Dynamic deadlock resolution protocols, in The 27th Annual Symposium on Foundations of Computer Science, 1986, 196-207.
2. R. BAR-YEHUDA, D. GEIGER, J. NAOR, AND R. M. ROTH, Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and Bayesian inference, SIAM J. Comput., 27 (1998), 942-959.
3. G. BRACHA AND S. TOUEG, A distributed algorithm for generalized deadlock detection, in Proceedings of the 3rd annual ACM symposium on Principles of distributed computing, ACM Press, 1984, 285-301.
4. K. M. CHANDY AND L. LAMPORT, Distributed snapshots: determining global states of distributed systems, ACM Transactions on Computer Systems (TOCS), 3 (1985), 63-75.
5. K, M. CHANDY AND J. MISRA, A distributed algorithm for detecting resource deadlocks in distributed systems, in Proceedings of the 1st ACM SIGACT-SIGOPS symposium on Principles of distributed computing, ACM Press, 1982, 157-164.
6. K. M. CHANDY, J. MISRA, AND L. M. HAAS, Distributed deadlock detection, ACM Transactions on Computer Systems (TOCS), 1 (1983), 144-156.
7. M. CHARIKAR, C. CHEKURI, T.-Y. CHEUNG, Z. DAI, A. GOEL, S. GUHA, AND M. LI, Approximation algorithms for directed Steiner problems, J. Algorithms, 33 (1999), 73-91.
8. J. CHERIYAN, H. J. KARLOFF, AND Y. RABANI, Approximating directed multicuts, in The 42th Annual Symposium on Foundations of Computer Science, 2001, 348-356.
9. G. EVEN, J. NAOR, B. SCHIEBER, AND M. SUDAN, Approximating minimum feedback sets and multicuts in directed graphs, Algorithmica, 20 (1998), 151-174.
10. U. FEIGE, A threshold of In n for approximating set cover, J. ACM, 45 (1998), 634-652.
11. M. FLATEBO AND A. K. DATTA, Self-stabilizing deadlock detection algorithms, in Proceedings of the '92 ACM annual conference on Communications, ACM Press, 1992, 117-122.
12. J. GRAY, P. HOMAN, R. OBERMARCK, AND H. KORTH, 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.
13. E. HALPERIN AND R. KRAUTHGAMER, Polylogarithmic inapproximability, in The 35th Annual ACM Symposium on Theory of Computing (STOC'03), 2003, 585-594.
14. J.-M. HELARY, C. JARD, N. PLOUZEAU, AND M. RAYNAL, Detection of stable properties in distributed applications, in Proceedings of the 6th PODC, ACM Press, 1987, 125-136.
15. T. HERMAN AND K. M. CHANDY, A distributed procedure to detect and/or deadlock, Tech. Rep. TR LCS-8301, Dept. of Computer Sciences, Univ. of Texas, 1983.
16. K. JAIN, M. MAHDIAN, AND M. R. SALAVATIPOUR, Packing Steiner trees, in The 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'03), 2003, 266-274.
17. E. KNAPP, Deadlock detection in distributed databases, ACM Computing Surveys (CSUR), 19 (1987), 303-328.
18. T. LEIGHTON AND S. RAO, Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms, J. ACM, 46 (1999), 787-832.
19. R. J. LIPTON AND R. E. TARJAN, Applications of a planar separator theorem, SIAM J. Comput., 9 (1980), 615-627.
20. C. LUND AND M. YANNAKAKIS, On the hardness of approximating minimization problems, J. Assoc. Comput. Mach., 41 (1994), 960-981.
21. K. MAKKI AND N. PISSINOU, Detection and resolution of deadlocks in distributed database systems, in Proceedings of the 4th international conference on Information and knowledge management, ACM Press, 1995, 411-416.
22. P. D. SEYMOUR, Packing directed circuits fractionally, Combinatorica, 15 (1995), 281-288.
23. H. Wu, W.-N. CHIN, AND J. JAFFAR, An efficient distributed deadlock avoidance algorithm for the and model, IEEE Transactions on Software Engineering, 28 (2002), 18-29.