DDS: Deadlock Detector and Solver

摘要

Deadlock is among the most complex problems that affect the reliability of concurrent programs such as real-time operating systems. Deadlocks occur when multiple processes or threads are mutually blocked while holding a resource required by another process or thread. Current deadlock detection methods are typically based on timeout mechanisms. Recovery from deadlocks frequently involves the rollback of computations, resulting in significant delays. Here we discuss Deadlock Detector and Solver (DDS), which can rapidly detect and resolve circular deadlocks in Java programs. The DDS uses a supervisory controller, which monitors program execution and automatically detects the deadlocks resulting from the hold-and-wait cycles in Java locks. When a deadlock is detected, the DDS uses a preemptive strategy to break it. We use static analysis to assist DDS when selecting the Java thread to be preempted. Our empirical results show that the DDS can monitor program execution and resolve deadlocks without significant runtime overhead.