Deadlock prevention in a distributed database system
ACM SIGMOD Record
Principles of distributed database systems (2nd ed.)
Principles of distributed database systems (2nd ed.)
ACM Computing Surveys (CSUR)
Some Deadlock Properties of Computer Systems
ACM Computing Surveys (CSUR)
Comment on deadlock preventive method
Communications of the ACM
The Logical Design of Operating Systems
The Logical Design of Operating Systems
A Multi-Granularity Locking Model for Concurrency Control in Object-Oriented Database Systems
IEEE Transactions on Knowledge and Data Engineering
On-the-fly deadlock prevention
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Impact of object operations and relationships on concurrency control in DOOS
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
| Hi-index | 0.00 |
This paper proposes a deadlock prevention algorithm for distributed object oriented systems based on the popular resource ordering technique. In distributed object oriented system, objects are the resources requested by the transactions. Though resource-ordering technique is not new, novelty of the proposed deadlock prevention algorithm lies in exploiting the relationships among objects present in the domain to do the resource ordering. Resource ordering rules are formally represented using predicate calculus. This algorithm also addresses the elimination of starvation in wealth and starvation in poverty by proposing a combination of timestamp and expedient access ordering of transactions in accessing the resources.