US5835766A
Expired / Lapsed
US
⏱️ 0.0 years remaining
System for detecting global deadlocks using wait-for graphs and identifiers of transactions related to the deadlocks in a distributed transaction processing system and a method of use therefore
Assignee: Fujitsu Ltd
•
Filing: 1995-10-19
•
Granted: 1998-11-10
•
Expires: 2015-10-19
Abstract
Abstract In a distributed transaction processing system, deadlocks generated between global transactions so as to stretch over a plurality of resource managers which access database can be detected, thus aiming at effective use of resources. For this reason, the system is configured in such a manner that a transaction manager for collectively managing global transactions is provided with global deadlock detector for detecting deadlocks generated so as to stretch over a plurality of resource managers between a plurality of global transactions which result from wait-for relation as to occupation of hardware resources.
Inventors
- 👤 Hiroiku Iba
- 👤 Hiroaki Ito
- 👤 Yasuhiko Hashizume
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 17:10
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/52; G06F9/524; G06F9/466; G06F2209/00; G06F2209/52; G06F2209/522; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99938
Claims Analysis
Total Claims: 21
Claim 1
Independent Claim
128 words
A distributed transaction processing system, comprising: a transaction manager which collectively manages a plurality of global transactions; a plurality of resource managers, each managing a part of each global transaction as a transaction branch, said resource managers accessing resources in response to a resource acquisition request by an application program and determines whether it is possible to occupy a resource using a global transaction, and if the resource has been occupied by another global transaction, notifies a global deadlock detector of an identifier of the another global transaction and an identifier of the global transaction concerned with the resource acquisition request; and the global deadlock detector detecting deadlocks stretching over a plurality of resource managers between global transactions which result from wait-for relations regarding occupation of the resources.
Claim 2
Dependent Claim
128 words
A distributed transaction processing system, comprising: a transaction manager which collectively manages a plurality of global transactions; a plurality of resource managers, each managing a part of each global transaction as a transaction branch, said resource managers accessing resources in response to a resource acquisition request by an application program and determines whether it is possible to occupy a resource using a global transaction, and if the resource has been occupied by another global transaction, notifies a global deadlock detector of an identifier of the another global transaction and an identifier of the global transaction concerned with the resource acquisition request; and the global deadlock detector detecting deadlocks stretching over a plurality of resource managers between global transactions which result from wait-for relations regarding occupation of the resources.
Claim 3
Dependent Claim
65 words
The distributed transaction processing system according to claim 1, wherein said global deadlock detector further comprises a wait-for graph having wait-for relations, regarding occupying resources between the plurality of global transactions, registered in response to a resource acquisition request issued by an application program for resources under the control of a resource manager, and said global deadlock detector detects global deadlocks using the wait-for graph.
Claim 4
Dependent Claim
66 words
The distributed transaction processing system according to claim 1, further comprising: a local lock manager which determines whether a transaction is a part of a global transaction in response to a resource release request issued from an application program, and which notifies said global deadlock detector of an identifier of the global transaction if the transaction is determined to be a part of a global transaction.
Claim 5
Dependent Claim
74 words
The distributed transaction processing system according to claim 1, further comprising: a local deadlock manager which determines whether a transaction is a part of a global transaction when receiving a dynamic occupation release request as a resource release request before termination of the global transaction from the application program, and notifies said deadlock detector of an identifier of the global transaction if the transaction is determined to be a part of the global transaction.
Claim 6
Dependent Claim
55 words
The distributed transaction processing system according to claim 1, further comprising: a local lock manager which issues an occupation range release request followed by a reduction to said global deadlock detector when receiving an occupation range reduction request for reducing an occupation range which is a part of a resource occupied by the global transaction.
Claim 7
Dependent Claim
94 words
The distributed transaction processing system according to claim 1, further comprising: a local lock manager which determines whether a global transaction with which a resource can be shared is newly generated when receiving a locking strength change request indicating whether a resource occupied by the global transaction is occupied in cooperation with another global transaction from the application program, and issues an occupation release request in response to a global transaction generated by an application program to said global deadlock detector when a global transaction with which the resource can be shared is generated.
Claim 8
Dependent Claim
52 words
The distributed transaction processing system according to claim 1, wherein when said global deadlock detector is detecting a deadlock between a plurality of global transactions, a global transaction is selected to be canceled in accordance with criteria specified by a user from among a plurality of global transactions concerned with the deadlock.
Claim 9
Dependent Claim
164 words
A distributed transaction processing system, comprising: a transaction manager which collectively manages a plurality of global transactions; a plurality of resource managers each managing a part of each global transaction as a transaction branch said resource manages accessing a resource, each resource manager, in response to a resource occupation request issued by an application program, determines whether it is possible to occupy a resource using a global transaction, and if the resource has been occupied by another global transaction, notifies said global deadlock detector of an identifier of the another global transaction and an identifier of the global transaction concerned with the resource acquisition request; the global deadlock detector detecting a deadlock stretching over a plurality of resource managers between a plurality of global transaction which result from wait-for relations regarding occupation of the resource; and local deadlock detectors which detect a deadlock between transaction branches executed within each of said resource managers or local transactions processed within each of said resource managers only.
Claim 10
Dependent Claim
164 words
A distributed transaction processing system, comprising: a transaction manager which collectively manages a plurality of global transactions; a plurality of resource managers each managing a part of each global transaction as a transaction branch said resource manages accessing a resource, each resource manager, in response to a resource occupation request issued by an application program, determines whether it is possible to occupy a resource using a global transaction, and if the resource has been occupied by another global transaction, notifies said global deadlock detector of an identifier of the another global transaction and an identifier of the global transaction concerned with the resource acquisition request; the global deadlock detector detecting a deadlock stretching over a plurality of resource managers between a plurality of global transaction which result from wait-for relations regarding occupation of the resource; and local deadlock detectors which detect a deadlock between transaction branches executed within each of said resource managers or local transactions processed within each of said resource managers only.
Claim 11
Dependent Claim
68 words
The distributed transaction processing system according to claim 8, wherein said global transaction deadlock detector is provided with a wait-for graph having wait-for relations, with respect to occupation of resources, registered in response to a resource acquisition request issued by an application program to the resource under the control of a resource manager, said global transaction deadlock detector detects a global deadlock using contents of said wait-for graph.
Claim 12
Dependent Claim
55 words
The distributed transaction processing system according to claim 8, wherein said local deadlock detectors, when both of the another transaction and the transaction concerned with a resource acquisition request, whose identifiers have been informed by a local lock managers, are transaction branches of a global transaction, notifies said global deadlock detecting of the two identifiers.
Claim 13
Dependent Claim
144 words
A processor for a distributed transaction processing system in a multiprocessor system having a plurality of processors, each processor comprising: a transaction manager which collectively manages a plurality of global transactions; a plurality of resource managers which access resources and which manage a part of each global transaction as a transaction branch; and a global deadlock detector for detecting deadlocks, in a subject processor, stretching over a plurality of resource managers, between global transactions which result from wait-for relations related to an occupation of the resources by: notifying a first processor in which a leading global transactions, in a wait-for relation with the subject processor, is generated, of the wait-for relation: receiving, from a second processor the wait-for relation of the second processor; and defining if a leading global transaction in the wait-for relation of the second processor is generated in the subject Processor.
Claim 14
Dependent Claim
144 words
A processor for a distributed transaction processing system in a multiprocessor system having a plurality of processors, each processor comprising: a transaction manager which collectively manages a plurality of global transactions; a plurality of resource managers which access resources and which manage a part of each global transaction as a transaction branch; and a global deadlock detector for detecting deadlocks, in a subject processor, stretching over a plurality of resource managers, between global transactions which result from wait-for relations related to an occupation of the resources by: notifying a first processor in which a leading global transactions, in a wait-for relation with the subject processor, is generated, of the wait-for relation: receiving, from a second processor the wait-for relation of the second processor; and defining if a leading global transaction in the wait-for relation of the second processor is generated in the subject Processor.
Claim 15
Dependent Claim
66 words
The processor according to claim 11, wherein said global deadlock detector is provided with a wait-for graph having wait-or relations, regarding occupation of resources between the plurality of global transactions, registered in response to a resource acquisition request issued by an application program to resources under the control of said resource manager, said global deadlock detector detects global deadlocks using the contents of the wait-for graph.
Claim 16
Independent Claim
146 words
A method of detecting deadlocks in a distributed transaction processing system having a plurality of resource managers and resources, the method comprising the steps of: collectively managing, using a global transaction manager, a plurality of global transactions stretching over the plurality of resource managers which manage a part of each global transaction as a transaction branch and access the resources; determining whether it is possible to occupy a resource with a global transaction in response to a resource acquisition request by an application program; notifying the global transaction manager of an identifier of another global transaction and an identity of the global transaction concerned with the resource acquisition request if the hardware resource has been occupied by the another global transaction; and detecting deadlocks stretching over the plurality of resource managers between global transactions which result from wait-for relations relate to occupation of the hardware resources.
Claim 17
Independent Claim
146 words
A method of detecting deadlocks in a distributed transaction processing system having a plurality of resource managers and resources, the method comprising the steps of: collectively managing, using a global transaction manager, a plurality of global transactions stretching over the plurality of resource managers which manage a part of each global transaction as a transaction branch and access the resources; determining whether it is possible to occupy a resource with a global transaction in response to a resource acquisition request by an application program; notifying the global transaction manager of an identifier of another global transaction and an identity of the global transaction concerned with the resource acquisition request if the hardware resource has been occupied by the another global transaction; and detecting deadlocks stretching over the plurality of resource managers between global transactions which result from wait-for relations relate to occupation of the hardware resources.
Claim 18
Independent Claim
168 words
A method of detecting deadlocks in a distributed transaction processing system having a plurality of resource mangers and resources, comprising the steps of: collectively managing, using a global transaction manager, a plurality of global transactions stretching over the plurality of resource managers which manage a part of each global transaction as a transaction branch and access the resources; determining whether it is possible to occupy a resource with a global transaction in response to a resource acquisition request by an application program; notifying the global transaction manager of an identifier of another global transaction and an identity of the global transaction concerned with the resource acquisition request if the hardware resource has been occupied by the another global transaction; detecting deadlocks generated stretching over the plurality of the resource managers between global transactions which result from wait-for relation related to occupation of the resources; and detecting deadlocks between transaction branches executed within each of the resource managers or local transactions processed within each of the resource managers only.
Claim 19
Independent Claim
168 words
A method of detecting deadlocks in a distributed transaction processing system having a plurality of resource mangers and resources, comprising the steps of: collectively managing, using a global transaction manager, a plurality of global transactions stretching over the plurality of resource managers which manage a part of each global transaction as a transaction branch and access the resources; determining whether it is possible to occupy a resource with a global transaction in response to a resource acquisition request by an application program; notifying the global transaction manager of an identifier of another global transaction and an identity of the global transaction concerned with the resource acquisition request if the hardware resource has been occupied by the another global transaction; detecting deadlocks generated stretching over the plurality of the resource managers between global transactions which result from wait-for relation related to occupation of the resources; and detecting deadlocks between transaction branches executed within each of the resource managers or local transactions processed within each of the resource managers only.
Claim 20
Independent Claim
139 words
A method of detecting deadlocks in a distributed transaction processing system of a multiprocessor system having hardware resources, comprising the steps of: collectively managing a plurality of global transactions stretching over a plurality of resource managers which manage a part of each global transaction as a transaction branch and access the hardware resources; and detecting deadlocks in a subject processor stretching over a plurality of resource managers between global transactions which result from wait-for relations regarding occupation of the hardware resources by: notifying a first processor in which a leading global transactions, in a wait-for relation with the subject processor, is generated, of the wait-for relation; receiving, from a second processor the wait-for relation of the second processor; and defining if a leading global transaction in the wait-for relation of the second processor is generated in the subject processor.
Claim 21
Independent Claim
139 words
A method of detecting deadlocks in a distributed transaction processing system of a multiprocessor system having hardware resources, comprising the steps of: collectively managing a plurality of global transactions stretching over a plurality of resource managers which manage a part of each global transaction as a transaction branch and access the hardware resources; and detecting deadlocks in a subject processor stretching over a plurality of resource managers between global transactions which result from wait-for relations regarding occupation of the hardware resources by: notifying a first processor in which a leading global transactions, in a wait-for relation with the subject processor, is generated, of the wait-for relation; receiving, from a second processor the wait-for relation of the second processor; and defining if a leading global transaction in the wait-for relation of the second processor is generated in the subject processor.
References Cited (Backward Citations)
US5504900A
Cited
US5504899A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-11-09 | 2002-05-11 | 2002-11-10 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-11-09 | 2006-05-11 | 2006-11-10 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-11-09 | 2010-05-11 | 2010-11-10 | $7700.00 | Window Closed / Lapsed |