Deadlock detection without wait-for graphs |
| |
Authors: | Dror G Feitelson |
| |
Affiliation: | Department of Computer Science, The Hebrew University of Jerusalem, 91904 Jerusalem, Israel |
| |
Abstract: | Deadlock detection is an important service that the run-time system of a parallel environment should provide. In parallel programs deadlock can occur when the different processes are waiting for various events, as opposed to concurrent systems, where deadlock occurs when processes wait for resources held by other processes. Therefore classical deadlock detection techniques such as checking for cycles in the wait-for graph are unapplicable. An alternative algorithm that checks whether all the processes are blocked is presented. This algorithm deals with situations in which the state transition from blocked to unblocked is indirect, as may happen when busy-waiting is used. |
| |
Keywords: | Distributed algorithm deadlock detection process blocking busy-waiting state transition |
本文献已被 ScienceDirect 等数据库收录! |
|