Semantic lock models in object-oriented distributed systems and deadlock resolution

Authors:
M. Roesler;W. A. Burkhard
Affiliations:
Department of Computer Science and Engineering, University of California, San Diego, La Jolla, California;Department of Computer Science and Engineering, University of California, San Diego, La Jolla, California
Venue:
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Year:
1988

Citing 7
Cited 5

A survey of distributed deadlock detection algorithms

ACM SIGMOD Record
Distributed deadlock detection algorithm

ACM Transactions on Database Systems (TODS)
Locking Primitives in a Database System

Journal of the ACM (JACM)
Distributed deadlock detection

ACM Transactions on Computer Systems (TOCS)
Notes on Data Base Operating Systems

Operating Systems, An Advanced Course
A distributed algorithm for detecting resource deadlocks in distributed systems

PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
NESTED TRANSACTIONS: AN APPROACH TO RELIABLE DISTRIBUTED COMPUTING

NESTED TRANSACTIONS: AN APPROACH TO RELIABLE DISTRIBUTED COMPUTING

Resolution of Deadlocks in Object-Oriented Distributed Systems

IEEE Transactions on Computers
A distributed deadlock detection and resolution algorithm based on a hybrid wait-for graph and probe generation scheme

CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
Deadlock detection in distributed database systems: a new algorithm and a comparative performance analysis

The VLDB Journal — The International Journal on Very Large Data Bases
Stochastic analysis of distributed deadlock scheduling

Proceedings of the twenty-fourth annual ACM 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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a distributed algorithm for detection and resolution of resource deadlocks in object-oriented distributed systems. The algorithm proposed is shown to detect and resolve all O(n1) cycles present in the worst case waits-for-graph (WFG) with n vertices by transmitting O(n3) messages of small constant size. Its average time complexity has been shown to be O(ne), where e is the number of edges in the WFG After deadlock resolution, the algorithm leaves information in the system concerning dependence relations of running transactions. This information will preclude the wasteful retransmission of messages and reduce the delay in detecting future deadlocks.