An efficient distributed deadlock avoidance algorithm for the AND model.

A new rank-based distributed deadlock avoidance algorithm for the AND resource request model is presented. Deadlocks are avoided by dynamically maintaining an invariant Con(WFG): For each pair of processes pi and pj, pi is allowed to wait for process pj iff the rank of pj is greater than that of pi...

詳細記述

書誌詳細

出版年:	IEEE Transactions on software engineering 28, 1 (2002).
第一著者:	Hui Wu
フォーマット:	論文
言語:	English
主題:	AND resource request model. WFG. Wait-For Graph. Concurrency control. Distributed deadlock avoidance algorithm. Dynamically modified ranks. Invariant. Multidimensional ranks. Partially ordered rank. Partially ordered ranks. Unnecessary process abortion.