Patent US6202079B1 successfully refreshed from Google Patents.
US6202079B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Synchronization procedure in a routing node
Assignee: International Business Machines Corp
•
Filing: 1996-05-30
•
Granted: 2001-03-13
•
Expires: 2016-05-30
Abstract
Abstract Disclosed is a method for providing synchronization of a transaction in a data processing system where the transaction involves an initiator node, which starts said synchronization, and a coordinator node, which decides the outcome of said transaction. The initiator node and the coordinator node communicate through a routing node. The routing node has no resources of its own which are modified in the transaction. The synchronization is provided by establishing a first conversation between the initiator node and the routing node and a second conversation between the routing node and the coordinator node. A first commit request message is then sent from said initiator node to the routing node. A second commit request message is sent from the routing node to the coordinator node. An additional step is performed of storing asynchronously, checkpoint information to non-volatile storage in the routing node after establishing the first and second conversations and before sending said second commit request message. The routing node acts as just a routing node and does not save checkpoint state as if it were a node with a real need to do so. In the event of failure the routing node only recovers the routing information, that is the end points of the conversation it was routing when failure occurred. The resynchronization protocols are carried between the end points with the routing node not aware of their contents, except to monitor when it can safely forget its routing information.
Inventors
- 👤 Timothy William Banks
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 23:26
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/466
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
147 words
A method for providing synchronization of a transaction in a data processing system including an initiator node, which starts said synchronization, and a coordinator node, which decides the outcome of said transaction, said initiator node and said coordinator node communicating through a routing node, the routing node having no resources related thereto modified in said transaction, said method comprising the steps of: establishing a first conversation between said initiator node and said routing node and a second conversation between said routing node and said coordinator node, sending a first commit request message from said initiator node to said routing node, sending a second commit request message from said routing node to said coordinator node, storing asynchronously, checkpoint information to a non-volatile storage in said routing node after said step of establishing said first and second conversations and before said step of sending said second commit request message.
Claim 2
Independent Claim
147 words
A method for providing synchronization of a transaction in a data processing system including an initiator node, which starts said synchronization, and a coordinator node, which decides the outcome of said transaction, said initiator node and said coordinator node communicating through a routing node, the routing node having no resources related thereto modified in said transaction, said method comprising the steps of: establishing a first conversation between said initiator node and said routing node and a second conversation between said routing node and said coordinator node, sending a first commit request message from said initiator node to said routing node, sending a second commit request message from said routing node to said coordinator node, storing asynchronously, checkpoint information to a non-volatile storage in said routing node after said step of establishing said first and second conversations and before said step of sending said second commit request message.
Claim 3
Dependent Claim
41 words
The method according to claim 1 , further including the step of sending from said routing node a first resynchronization message to said initiator node and a second resynchronization message to said coordinator node after a failure in said routing node.
Claim 4
Dependent Claim
38 words
The method according to claim 2 , further including the step of forgetting said transaction in said routing node after receiving a message by said initiator node or said coordinator node indicating that said transaction has been forgotten.
Claim 5
Dependent Claim
22 words
The method according to claim 1 , wherein further checkpoint information is stored only in a volatile memory in said routing node.
Claim 6
Dependent Claim
41 words
The method according to claim 4 , further including the step of sending from said routing node a first resynchronization message to said initiator node and a second resynchronization message to said coordinator node after a failure in said routing node.
Claim 7
Dependent Claim
38 words
The method according to claim 5 , further including the step of forgetting said transaction in said routing node after receiving a message by said initiator node or said coordinator node indicating that said transaction has been forgotten.
Claim 8
Dependent Claim
146 words
A distributed data processing system in which a transaction can be synchronized, the system comprising: an initiator node for starting said synchronization; a coordinator node for deciding the outcome of said transaction; and a routing node having no resources related thereto, modified in said transaction; wherein said initiator node and said coordinator node are arranged to communicate by means of a first conversation between said initiator node and said routing node and a second conversation between said routing node and said coordinator node; said initiator node comprises means for sending to said routing node a first commit request message; and said routing node comprises means for sending a second commit request message to said coordinator node; characterized in that: the routing node further comprises means for storing asynchronously, checkpoint information in non-volatile storage after said first and second conversations and before said second commit request message.
Claim 9
Dependent Claim
146 words
A distributed data processing system in which a transaction can be synchronized, the system comprising: an initiator node for starting said synchronization; a coordinator node for deciding the outcome of said transaction; and a routing node having no resources related thereto, modified in said transaction; wherein said initiator node and said coordinator node are arranged to communicate by means of a first conversation between said initiator node and said routing node and a second conversation between said routing node and said coordinator node; said initiator node comprises means for sending to said routing node a first commit request message; and said routing node comprises means for sending a second commit request message to said coordinator node; characterized in that: the routing node further comprises means for storing asynchronously, checkpoint information in non-volatile storage after said first and second conversations and before said second commit request message.
Claim 10
Dependent Claim
147 words
A routing node for use in a distributed data processing system in which a transaction can be synchronized, the system comprising an initiator node for starting said synchronization, a coordinator node for deciding the outcome of said transaction, wherein said initiator node and said coordinator node are arranged to communicate by means of a first conversation between said initiator node and said routing node and a second conversation between said routing node and said coordinator node, said initiator node comprises means for sending to said routing node a first commit request message; the routing node, having no resources related thereto, modified in said transaction, comprising: means for sending a second commit request message to said coordinator node; characterized in that: the routing node further comprises means for storing asynchronously, checkpoint information in non-volatile storage after said first and second conversations and before said second commit request message.
Claim 11
Dependent Claim
147 words
A routing node for use in a distributed data processing system in which a transaction can be synchronized, the system comprising an initiator node for starting said synchronization, a coordinator node for deciding the outcome of said transaction, wherein said initiator node and said coordinator node are arranged to communicate by means of a first conversation between said initiator node and said routing node and a second conversation between said routing node and said coordinator node, said initiator node comprises means for sending to said routing node a first commit request message; the routing node, having no resources related thereto, modified in said transaction, comprising: means for sending a second commit request message to said coordinator node; characterized in that: the routing node further comprises means for storing asynchronously, checkpoint information in non-volatile storage after said first and second conversations and before said second commit request message.
References Cited (Backward Citations)
US5039980A
Cited
US5319773A
Cited
US5410684A
Cited
US5261089A
Cited
US5276876A
Cited
US5390298A
Cited
US5235597A
Cited
US5258982A
Cited
US5500860A
Cited
US5465251A
Cited
US5550873A
Cited
US5574849A
Cited
US5561797A
Cited
US5630047A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2004-03-12 | 2004-09-11 | 2005-03-13 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2008-03-12 | 2008-09-11 | 2009-03-13 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2012-03-12 | 2012-09-11 | 2013-03-13 | $7700.00 | Window Closed / Lapsed |