Deadlock detection and resolution in distributed processing systems
The availability of distributed data bases is directly affected by the timely detection and resolution of deadlocks. Consequently, mechanisms are needed to make deadlock detection algorithms resilient to failures. Presented first is a centralized algorithm that allows transactions to have multiple requests outstanding. Next, a new distributed deadlock detection algorithm (DDDA) is presented, using a global detector (GD) to detect global deadlocks and local detectors (LDs) to detect local deadlocks. This algorithm essentially identifies transaction-resource interactions that m cause global (multisite) deadlocks. Third, a deadlock detection algorithm utilizing a transaction-wait-for (TWF) graph is presented. It is a fully disjoint algorithm that allows multiple outstanding requests. The proposed algorithm can achieve improved overall performance by using multiple disjoint controllers coupled with the two-phase property while maintaining the simplicity of centralized schemes. Fourth, an algorithm that combines deadlock detection and avoidance is given. This algorithm uses concurrent transaction controllers and resource coordinators to achieve maximum distribution. The language of CSP is used to describe this algorithm. Finally, two efficient deadlock resolution protocols are given along with some guidelines to be used in choosing a transaction for abortion.
- Research Organization:
- Ohio State Univ., Columbus (USA)
- OSTI ID:
- 6742364
- Country of Publication:
- United States
- Language:
- English
Similar Records
A Model for Deadlock-Free Resource Allocation [Thesis]
Physical Volume Library deadlock avoidance in a striped media environment
Related Subjects
990210 -- Supercomputers-- (1987-1989)
990300* -- Information Handling
ALGORITHMS
COMPUTERS
DATA BASE MANAGEMENT
DATA PROCESSING
DIGITAL COMPUTERS
DISTRIBUTED DATA PROCESSING
FAULT TOLERANT COMPUTERS
MANAGEMENT
MATHEMATICAL LOGIC
PERFORMANCE
PROCESSING
PROGRAMMING LANGUAGES