摘要

In existing deadlock detection and resolution algorithms, only a few of them can handle deadlocks in generalized request models. Most of these algorithms diffuse probes and collect dependency information in the replies. In this paper, we propose an efficient algorithm to detect and resolve generalized deadlocks. In this algorithm, replies are sent after a process has received all the messages from its predecessors. This mechanism reduces both the quantity and total size of the messages. The message number of our proposed algorithm is O(e + n). And the experiment shows that our algorithm has better performance in concurrent executions.

全文