A New Algorithm and Asymptotical Properties for the Deadlock Detection Problem for Computer Systems with Reusable Resource Types

We study the classical problem of deadlock detection for systems with n processes and d reusable resource types, where d≪n. We present a novel algorithm for the problem. The algorithm enjoys two properties. First, its cost is n/log(n) times sm aller than that of the well-known Dijkstra’s algorithm,...

Full description

Saved in:
Bibliographic Details
Published inAdvances and Innovations in Systems, Computing Sciences and Software Engineering pp. 509 - 512
Main Authors Li, Youming, Cook, Robert
Format Book Chapter
LanguageEnglish
Published Dordrecht Springer Netherlands 2007
Subjects
Deadlock Detection
Deadlock State
Dijkstra Algorithm
Resource Request
Resource Type
Online AccessGet full text
ISBN9781402062636
140206263X
DOI10.1007/978-1-4020-6264-3_88

Cover

More Information
Summary:We study the classical problem of deadlock detection for systems with n processes and d reusable resource types, where d≪n. We present a novel algorithm for the problem. The algorithm enjoys two properties. First, its cost is n/log(n) times sm aller than that of the well-known Dijkstra’s algorithm, when d=O(log(n)). Secondly, its data structures are simple and easy to maintain. In particular, the algorithm employs no graph or tree based data structures. We also derive a linear-time algorithm when d and the resource requests are bounded by constants. The linear-time algorithm is asymptotically optimal. The algorithms are applicable to improving the Banker’s algorithm for deadlock avoidance. Categories and Subject Descriptors: D.4.1 Operating Systems: Process Management; General Terms: Deadlock, algorithms, performance
ISBN:9781402062636
140206263X
DOI:10.1007/978-1-4020-6264-3_88