〔閲覧〕【著作】([下村 隆夫]/[池田 建司]/Two Types of Deadlock Detection: Cyclic and Acyclic/Intelligent Systems for Science and Information, Studies in Computational Intelligence)
(英) Two Types of Deadlock Detection: Cyclic and Acyclic (日)
[継承]
○副題(任意):
○要約(任意):
□
(英) Concurrent programs are difficult to test and debug due to their non-deterministic execution. For deadlocks, traditional deadlock detection algorithms depend on finding cycles in lock graphs created from application programs. This paper first introduces three kinds of blocked relations, lock-blocked, wait-blocked, and join-blocked for Java multi-threaded programs. Previous work does not consider the wait-blocked relations, nor the influence of thread interruption. The paper then proposes two types of deadlocks based on these blocked relations, that is, block-cycle type deadlocks and waiting-block type deadlocks which are acyclic. It also presents an example of implementation to detect these types of deadlocks, and addresses future directions. (日)
Takao ShimomuraandKenji Ikeda : Two Types of Deadlock Detection: Cyclic and Acyclic, Intelligent Systems for Science and Information, Studies in Computational Intelligence, Vol.542, (号), 233-259, 2014.
欧文冊子 ●
Takao ShimomuraandKenji Ikeda : Two Types of Deadlock Detection: Cyclic and Acyclic, Intelligent Systems for Science and Information, Studies in Computational Intelligence, Vol.542, (号), 233-259, 2014.
関連情報
Number of session users = 3, LA = 0.47, Max(EID) = 373285, Max(EOID) = 998647.