Gadara: Dynamic deadlock avoidance for multithreaded programs

Proceedings of the 8th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2008

Volumn , Issue , 2019, Pages 281-294

  Wang, Yin ^a,b   Kelly, Terence ^b   Kudlur, Manjunath ^a   Lafortune, Stéphane ^a   Mahlke, Scott ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

^b HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; CONCURRENCY CONTROL; MULTICORE PROGRAMMING; PARALLEL PROGRAMMING; SOFTWARE TESTING; STATIC ANALYSIS; SYSTEMS ANALYSIS;

BENCHMARK TESTS; DEADLOCK AVOIDANCE; DISCRETE CONTROL THEORIES; MODEL PROGRAMS; MULTI-THREADED PROGRAMS; REAL APPLICATIONS; RUN-TIME PERFORMANCE; SOFTWARE TRANSACTIONAL MEMORY;

C (PROGRAMMING LANGUAGE);

EID: 85076879202     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (50)

1. AGARWAL, R., AND STOLLER, S. D. Run-time detection of potential deadlocks for programs with locks, semaphores, and condition variables. In Proc. Workshop on Parallel and Distributed Systems: Testing and Debugging (2006).
2. AGARWAL, R., WANG, L., AND STOLLER, S. D. Detecting potential deadlocks with static analysis and runtime monitoring. In Proc. Parallel and Distributed Systems (2006), vol. 3875 of LNCS, Springer-Verlag.
3. BAUGH, L., AND ZILLES, C. An analysis of i/o and syscalls in critical sections and their implications for transactional memory. In TRANSACT (2007).
4. BOER, E. R., AND MURATA, T. Generating basis siphons and traps of Petri nets using the sign incidence matrix. IEEE Trans. on Circuits and Systems-I 41, 4 (1994).
5. CASSANDRAS, C. G., AND LAFORTUNE, S. Introduction to Dsicrete Event Systems, second ed. Springer, 2007.
6. CLARKE, E., GRUMBERG, O., AND PELED, D. Model Checking. MIT Press, 2002.
7. DIJKSTRA, E. W. Solution of a problem in concurrent programming control. CACM 8, 9 (1965).
8. DIJKSTRA, E. W. Selected Writings on Computing. Springer-Verlag, 1982, ch. The Mathematics Behind the Banker's Algorithm.
9. ENGLER, D., AND ASHCRAFT, K. RacerX: effective, static detection of race conditions and deadlocks. In SOSP (2003).
10. FINKEL, R., AND MADDURI, H. H. An efficient deadlock avoidance algorithm. Inf. Process. Lett. 24, 1 (1987).
11. FLANAGAN, C., LEINO, K. R. M., LILLIBRIDGE, M., NELSON, G., SAXE, J. B., AND STATA, R. Extended static checking for Java. In PLDI (2002).
12. GOLD, E. M. Deadlock prediction: Easy and difficult cases. SIAM J. Comput. 7, 3 (1978).
13. HABERMANN, A. N. Prevention of system deadlocks. CACM 12, 7 (1969).
14. HELLERSTEIN, J. L., DIAO, Y., PAREKH, S., AND TILBURY, D. M. Feedback Control of Computing Systems. Wiley, 2004.
15. HOLLOWAY, L., KROGH, B., AND GIUA, A. A survey of Petri net methods for controlled discrete event systems. Discrete Event Dynamic Systems: Theory and Applications 7, 2 (1997).
16. HOLT, R. C. Comments on prevention of system deadlocks. CACM 14, 1 (1971).
17. HOLT, R. C. Some deadlock properties of computer systems. ACM Comput. Surv. 4, 3 (1972).
18. Intel C++ STM Compiler, Prototype Edition, Jan. 2008.
19. IORDACHE, M. V., AND ANTSAKLIS, P. J. Supervisory Control of Concurrent Systems: A Petri Net Structural Approach. Birkhäuser, 2006.
20. JULA, H., AND CANDEA, G. A scalable, sound, eventually-complete algorithm for deadlock immunity. In Workshop on Runtime Verification (2008).
21. KAVI, K. M., MOSHTAGHI, A., AND YI CHEN, D. Modeling multithreaded applications using Petri nets. International Journal of Parallel Programming 30, 5 (2002).
22. KNUTH, D. E. Additional comments on a problem in concurrent programming control. CACM 9, 5 (1966).
23. LANDI, W. Undecidability of static analysis. ACM Lett. Program. Lang. Syst. 1, 4 (1992).
24. LANG, S.-D. An extended banker's algorithm for deadlock avoidance. IEEE Trans. Software Eng 25, 3 (1999).
25. LARUS, J., AND RAJWAR, R. Transactional Memory. Morgan & Claypool Publishers, 2007.
26. LEE, E. A. The problem with threads. Tech. rep., UC Berkeley EE & CS Department, Jan. 2006.
27. LI, Z., ZHOU, M., AND WU, N. A survey and comparison of Petri net-based deadlock prevention policies for flexible manufacturing systems. IEEE Trans. on Systems, Man, and Cybernetics-Part C 38, 2 (2008).
28. LU, S., PARK, S., SEO, E., AND ZHOU, Y. Learning from mistakes: a comprehensive study on real world concurrency bug characteristics. In ASPLOS (2008).
29. MILLER, M. S. Robust Composition: Towards a Unified Approach to Access Control and Concurrency Control. PhD thesis, Johns Hopkins University, 2006.
30. MINOURA, T. Deadlock avoidance revisited. J. ACM 29, 4 (1982).
31. MOODY, J. O., AND ANTSAKLIS, P. J. Supervisory Control of Discrete Event Systems Using Petri Nets. Kluwer Academic Publishers, 1998.
32. MURATA, T. Petri nets: Properties, analysis and applications. Proceedings of the IEEE 77, 4 (1989).
33. NEWTON, G. Deadlock prevention, detection, and resolution: an annotated bibliography. SIGOPS Oper. Syst. Rev. 13, 2 (1979).
34. NI, Y., WELC, A., ADL-TABATABAI, A.-R., BACH, M., BERKOWITS, S., COWNIE, J., GEVA, R., KOZHUKOW, S., NARAYANASWAMY, R., PREIS, J. O. S., SAHA, B., TAL, A., AND TIAN, X. Design and implementation of transactional constructs for C/C++. In OOPSLA(2008).
35. NIR-BUCHBINDER, Y., TZOREF, R., AND UR, S. Deadlocks: from exhibiting to healing. In Workshop on Runtime Verification (2008).
36. OpenIMPACT. http://www.gelato.uiuc.edu/.
37. OpenLDAP Issue Tracking System. http://www.openldap.org/its/.
38. QIN, F., TUCEK, J., ZHOU, Y., AND SUNDARESAN, J. Rx: Treating bugs as allergies-safe method to survive software failures. ACM TOCS 25, 3 (2007).
39. REVELIOTIS, S. A. Real-Time Management of Resource Allocation Systems: A Discrete-Event Systems Approach. Springer, 2005.
40. SAVAGE, S., BURROWS, M., NELSON, G., SOBALVARRO, P., AND ANDERSON, T. Eraser: A dynamic data race detector for multithreaded programs. ACM TOCS 15, 4 (1997).
41. SCHROEDER, B., WIERMAN, A., AND HARCHOL-BALTER, M. Open versus closed: A cautionary tale. In NSDI (2006).
42. SPEAR, M. F., SILVERMAN, M., DALESSANDRO, L., MICHAEL, M. M., AND SCOTT, M. L. Implementing and exploiting inevitability in software transactional memory. In Int'l. Conf. on Parallel Processing (2008).
43. SUN. WorkShop: Command-Line Utilities. Sun Press, 2006, ch. 24: Using Lock Lint.
44. SUTTER, H., AND LARUS, J. Software and the concurrency revolution. ACM Queue 3, 7 (2005).
45. TRICAS, F., COLOM, J. M., AND EZPELETA, J. Some improvements to the banker's algorithm based on the process structure. In IEEE Int'l. Conf. on Robotics and Automation (2000).
46. WALLACE, C., JENSEN, P., AND SOPARKAR, N. Supervisory control of workflow scheduling. In Proc. Int'l. Workshop on Advanced Transaction Models and Architectures (1996).
47. WANG, Y., KELLY, T., KUDLUR, M., MAHLKE, S., AND LAFORTUNE, S. The application of supervisory control to deadlock avoidance in concurrent software. In Workshop on Discrete Event Systems (2008).
48. WANG, Y., KELLY, T., AND LAFORTUNE, S. Discrete control for safe execution of IT automation workflows. In EuroSys (2007).
49. WELC, A., SAHA, B., AND ADL-TABATABAI, A.-R. Irrevocable transactions and their applications. In SPAA (2008).
50. ZÖBEL, D., AND KOCH, C. Resolution techniques and complexity results with deadlocks: a classifying and annotated bibliography. SIGOPS Oper. Syst. Rev. 22, 1 (1988).