More Effective Approach to Detecting Potential Deadlocks, DEPT(DEPendency Track...
summary
DEPT is a runtime dependency tracker that tracks waits and events instead of only lock acquisition order, and it finds deadlocks lockdep misses — for example it captures PG_lock vs NI_lock deadlocks in NTFS and folio-lock+mutex cases reported on LKML. It models waits as dependencies, uses lock-class grouping today, supports annotations and multi-reporting with blacklisting to avoid duplicates, exposes an interface to view dependencies, has an aggressive mode that reports timeout waits, and currently costs more overhead than lockdep.
AI-written summary · about
chapters (8)
- 0:00Introduction to deadlock detection
- 3:38Lockdep's dependency tracking
- 6:56Introducing DEPT tool
- 13:34How DEPT works in practice
- 25:26Benefits of using DEPT
- 36:49Kernel vs user space implementation
- 45:04Handling duplicate reports
- 48:00Q&A and summary
related talks
37mMore Effective Approach To Detecting Potential Deadlocks, DEPT(DEPendency Tracker)
15mSound Dynamic Deadlock Prediction in Linear Time
33mModularization for Lockdep
48mDPTrace: Dual Purpose Trace for Exploitability Analysis of Program Crashes
55mJava PathFinder: going to Mars without bugs and deadlocks
22mIt depends: A dialog about dependencies
18mEnhancing Static Analysis for Practical Bug Detection: An LLM-Integrated Approach
18mAutomating Product Deprecation