論文

査読有り
2014年1月8日

Two Types of Deadlock Detection: Cyclic and Acyclic

Intelligent Systems for Science and Information, Studies in Computational Intelligence
  • 下村 隆夫
  • ,
  • 池田 建司

Vol.542
開始ページ
233
終了ページ
259
記述言語
英語
掲載種別
研究論文(学術雑誌)
DOI
10.1007/978-3-319-04702-7_14

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.

リンク情報
DOI
https://doi.org/10.1007/978-3-319-04702-7_14
URL
https://web.db.tokushima-u.ac.jp/cgi-bin/edb_browse?EID=274182
URL
https://www.scopus.com/record/display.url?eid=2-s2.0-84958530569&origin=inward

エクスポート
BibTeX RIS