Please use this identifier to cite or link to this item:
|Title:||On deadlocks of exclusive AND-requests for resources|
|Authors:||Tay, Y.C. |
|Citation:||Tay, Y.C., Loke, W.T. (1995-10). On deadlocks of exclusive AND-requests for resources. Distributed Computing 9 (2) : 77-94. ScholarBank@NUS Repository. https://doi.org/10.1007/s004460050011|
|Abstract:||Although there are numerous concurrency control algorithms and they use a variety of techniques, there is an underlying serializability theory that serves both as a basis for analyzing their correctness and as a guide for designing new protocols. Following this paradigm, this paper proposes a uniform framework for characterizing and developing distributed deadlock-related algorithms. The system considered here consists of processes making multiple requests for exclusive access to resources. The results examine the role of process abortion and the asymmetry between processes and resources. To illustrate the generality of the framework, the results are used to analyze several well-known deadlock detectors, thus revealing a common structure among them, despite the variety of techniques they use. © 1995 Springer-Verlag.|
|Source Title:||Distributed Computing|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Aug 16, 2018
WEB OF SCIENCETM
checked on Jul 24, 2018
checked on Mar 12, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.