Please use this identifier to cite or link to this item:
Title: An efficient distributed deadlock avoidance algorithm for the AND model
Authors: Wu, H. 
Chin, W.-N. 
Jaffar, J. 
Keywords: Concurrency control
Distributed deadlock avoidance
Partially ordered rank
Wait-for graph
Issue Date: 2002
Citation: Wu, H., Chin, W.-N., Jaffar, J. (2002). An efficient distributed deadlock avoidance algorithm for the AND model. IEEE Transactions on Software Engineering 28 (1) : 18-29. ScholarBank@NUS Repository.
Abstract: 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 wait for process pj iff the rank of pj is greater than that of pi for the WFG (Wait-For Graph). Our algorithm neither restricts the order of resource requests nor needs a priori information about resource requests nor causes unnecessary abortion of processes. Multidimensional ranks, which are partially ordered and dynamically modified, are used to drastically reduce the cost of maintaining Con(WFG). Our simulation results show that the performance of our algorithm is better than that of existing algorithms.
Source Title: IEEE Transactions on Software Engineering
ISSN: 00985589
DOI: 10.1109/32.979987
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.