Matches in SemOpenAlex for { <https://semopenalex.org/work/W125520871> ?p ?o ?g. }
Showing items 1 to 63 of
63
with 100 items per page.
- W125520871 abstract "The availability of distributed databases 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 in this dissertation 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 may cause global (multisite) deadlocks. Such interactions are reported to the global controller, while the remaining interactions are handled locally. In order to make the DDDA fault-tolerant, three procedures have been incorporated to handle failures of the controller, failures of any of the local sites, and failures of communication links. This enhanced algorithm, called FTDDDA, improves the overall performance of the database system by improving resiliency of the deadlock detection service.Third, a deadlock detection algorithm utilizing a transaction-wait-for (TWF) graph is presented. It is a fully disjoint algorithm which 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. The detection step is divided into two phases. Phase I analyzes the conditions of the system of interacting transactions and invokes phase 2 only if conditions are possible for deadlocks to occur. Phase 2 performs the actual cycle detection. The proposed algorithm can be used in distributed database systems, as well as in transaction-processing systems. Certain results regarding the complexity of the algorithm are given in the worst, average and best cases, with special emphasis on the worst case analysis.Fourth, an algorithm which 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. In addition, we show that all deadlocks will be detected by this algorithm and further that the communicating components of this algorithm are deadlock free.Finally, two efficient deadlock resolution protocols are given along with some guidelines to be used in choosing a transaction for abortion." @default.
- W125520871 created "2016-06-24" @default.
- W125520871 creator A5089912733 @default.
- W125520871 date "1985-01-01" @default.
- W125520871 modified "2023-09-23" @default.
- W125520871 title "Deadlock detection and resolution in distributed processing systems (ddbms, synchronization)" @default.
- W125520871 hasPublicationYear "1985" @default.
- W125520871 type Work @default.
- W125520871 sameAs 125520871 @default.
- W125520871 citedByCount "2" @default.
- W125520871 crossrefType "journal-article" @default.
- W125520871 hasAuthorship W125520871A5089912733 @default.
- W125520871 hasConcept C113429609 @default.
- W125520871 hasConcept C11413529 @default.
- W125520871 hasConcept C114614502 @default.
- W125520871 hasConcept C120314980 @default.
- W125520871 hasConcept C130120984 @default.
- W125520871 hasConcept C159023740 @default.
- W125520871 hasConcept C199360897 @default.
- W125520871 hasConcept C33923547 @default.
- W125520871 hasConcept C41008148 @default.
- W125520871 hasConcept C45340560 @default.
- W125520871 hasConcept C75949130 @default.
- W125520871 hasConcept C79403827 @default.
- W125520871 hasConceptScore W125520871C113429609 @default.
- W125520871 hasConceptScore W125520871C11413529 @default.
- W125520871 hasConceptScore W125520871C114614502 @default.
- W125520871 hasConceptScore W125520871C120314980 @default.
- W125520871 hasConceptScore W125520871C130120984 @default.
- W125520871 hasConceptScore W125520871C159023740 @default.
- W125520871 hasConceptScore W125520871C199360897 @default.
- W125520871 hasConceptScore W125520871C33923547 @default.
- W125520871 hasConceptScore W125520871C41008148 @default.
- W125520871 hasConceptScore W125520871C45340560 @default.
- W125520871 hasConceptScore W125520871C75949130 @default.
- W125520871 hasConceptScore W125520871C79403827 @default.
- W125520871 hasLocation W1255208711 @default.
- W125520871 hasOpenAccess W125520871 @default.
- W125520871 hasPrimaryLocation W1255208711 @default.
- W125520871 hasRelatedWork W1505786368 @default.
- W125520871 hasRelatedWork W1582482077 @default.
- W125520871 hasRelatedWork W168271757 @default.
- W125520871 hasRelatedWork W1914400150 @default.
- W125520871 hasRelatedWork W2002170071 @default.
- W125520871 hasRelatedWork W2044770819 @default.
- W125520871 hasRelatedWork W2067684532 @default.
- W125520871 hasRelatedWork W2103115124 @default.
- W125520871 hasRelatedWork W2127344959 @default.
- W125520871 hasRelatedWork W2140067789 @default.
- W125520871 hasRelatedWork W2142044754 @default.
- W125520871 hasRelatedWork W2143834889 @default.
- W125520871 hasRelatedWork W2144369508 @default.
- W125520871 hasRelatedWork W2158194632 @default.
- W125520871 hasRelatedWork W2166954426 @default.
- W125520871 hasRelatedWork W2182939804 @default.
- W125520871 hasRelatedWork W2406733677 @default.
- W125520871 hasRelatedWork W2473945364 @default.
- W125520871 hasRelatedWork W2741339490 @default.
- W125520871 hasRelatedWork W3140720071 @default.
- W125520871 isParatext "false" @default.
- W125520871 isRetracted "false" @default.
- W125520871 magId "125520871" @default.
- W125520871 workType "article" @default.