Abstract

A distributed algorithm is proposed for detection and resolution of resource deadlocks in object-oriented distributed systems. The algorithm can be used in conjunction with concurrency control algorithms that are based on the semantic lock model. To drastically reduce message traffic, the algorithm properly identifies and eliminates redundant messages. It is shown that its worst and average time complexities are O(ne), where e is the number of edges in the waits-for graph and n is the number of vertices. >

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.