Dreadlocks: Efficient deadlock detection

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2008, Pages 297-303

  Koskinen, Eric ^a   Herlihy, Maurice ^a  

^a Brown Univerity   (United States)

Author keywords

Bloom filters; Concurrency; Deadlock; Deadlock detection; Parallel programming; Transactional memory

Indexed keywords

BLOOM FILTERS; CONCURRENCY; DEADLOCK; DEADLOCK DETECTION; TRANSACTIONAL MEMORY;

BLOOMS (METAL); BOOLEAN FUNCTIONS; PARALLEL PROGRAMMING; SPIN DYNAMICS; WAVE FILTERS;

PARALLEL ALGORITHMS;

EID: 57349141427     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1378533.1378585     Document Type: Conference Paper

References (20)

1. bLOOM, B, H. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM IS, 7 (1970), 422-426.
2. BRODER, A., and MITZENMACHER. M. Network Applications of Bloom Filters: A Survey. Internet Mathematics 1, 4 (2004), 485-509.
3. cORBETT, J. c. Evaluating deadlock detection methods for concurrent software. IEEE Trans. Softw. Eng. 22, 3 (1996), 161-180.
4. DEMARTINI, C, IOSIF, R., and SISTO, R. A deadlock detection tool for concurrent Java programs. Softw. Pract. Exper. 29, 7 (1999), 577-603.
5. DICE, D., SHALEV, O., and SHAVIT, N. Transactional locking II. In Proceedings of the 20th International Symposium on Distributed Computing (DISC '06) (September 2006).
6. DICE, D., AND SHAVIT, N. What really makes transactions fast. ACM SIGPLAN Workshop on Transactional Computing, Ottawa, ON, Canada, June (2006).
7. ENNALS, R. Software transactional memory should not be obstruction-free. Unpublished manuscript, Intel Research Cambridge (2005).
8. HERLIHY, M., and KOSKINEN, E. Transactional boosting: A methodology for highly concurrent transactional objects. In Proceedings of the 13th ACM SIGPLAN symposium on Principles and practice of parallel programming (PPoPP '08) (2008).
9. HERLIHY, M. P., and WING, J. M. Linearizability: a correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems (TOPLAS) 12, 3 (1990), 463-492.
10. HOLZMANN, G. The Spin Model Checker: Primer and Reference Manual. Addison-Wesley, 2004.
11. KAVEH, N., and EMMERICH, W. Deadlock detection in distribution object systems. SIGSOFT Softw. Eng. Notes 26, 5 (2001), 44-51.
12. KNAPP, E. Deadlock detection in distributed databases. ACM Comput. Surv. 19, 4 (1987), 303-328.
13. LI, T., ELLIS, C. S., LEBECK, A. R., and SORIN, D. J. Pulse: a dynamic deadlock detection mechanism using speculative execution. In ATEC'05: Proceedings of the USENIX Annual Technical Conference 2005 on USENIX Annual Technical Conference (Berkeley, CA, USA, 2005), USENIX Association, pp. 3-3.
14. LUECKE, G., ZOU, Y., COYLE, J., HOEKSTRA, J., and KRAEVA, M. Deadlock detection in MPI programs. Concurrency and Computation: Practice and Experience 14, 11 (2002), 911-932.
15. MIKK, E., LAKHNECH, Y., SIEGEL, M., and HOLZMANN, G. Implementing statecharts in PROMELA/SPIN. Industrial Strength Formal Specification Techniques, 1998. Proceedings. 2nd IEEE Workshop on (1998), 90-101.
16. MURATA, T., SHENKER, B., and SHATZ, S. Detection of ada static deadlocks using petri net invariants. Transactions on Software Engineering 15, 3 (Mar 1989), 314-326.
17. SAHA, B., ADL-TABATABAI, A., HUDSON, R., MINH, C., and HERTZBERG, B. McRT-STM: a high performance software transactional memory system for a multi-core runtime. Proceedings of the eleventh ACM SIGPLAN symposium on Principles and Practice of Parallel Programming (PPOPP '06) (2006), 187-197.
18. SCOTT, M. L. Non-blocking timeout in scalable queue-based spin locks. In PODC '02: Proceedings of the twenty-first annual symposium on Principles of distributed computing (New York, NY, USA, 2002), ACM Press, pp. 31-40.
19. SLNGHAL, M. Deadlock detection in distributed systems. Computer 22, 11 (1989), 37-48.
20. VETTER, J. S., and dE SUPINSKI, B. R. Dynamic software testing of mpi applications with umpire, sc. 00 (2000), 51.