US5734897A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Reduction of logging in distributed systems
Assignee: International Business Machines Corp
•
Filing: 1996-06-04
•
Granted: 1998-03-31
•
Expires: 2016-06-04
Abstract
Abstract A method, for use in a two phase commit protocol, of reducing the number of agents writing to a log and the number of points in a transaction at which the log must guarantee the durability of the data is disclosed. If all of the agents involved in a transaction have access to the same log and if in a network it is relatively expensive to send a message, but little penalty for sending a long message compared to a short one, then improved performance can be obtained by sending both the data to be written to the log and the request commit flows in the same communications buffer.
Inventors
- 👤 Andrew David Banks
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 04:03
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/20; G06F16/23; G06F16/2358; G06F11/00; G06F11/07; G06F11/14; G06F11/1471; Y; Y10; Y10S; Y10S707/00; Y10S707/99951; Y10S707/99952; Y10S707/99953
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
212 words
A method, for use in a two phase commit protocol between a plurality of agents, each agent having an associated recovery log, of reducing the number of forced writes to recovery logs, the method comprising the steps of: a first agent sending a commit request to a next agent in a chain of agents; each subsequent agent in said chain sending said commit request received from a previous agent in the chain to a next agent in the chain, until a last agent in the chain has been reached; writing by said last agent to its associated recovery log of a commit record indicating that the changes are to be committed; said last agent sending a committed message to a previous agent in a chain of agents; and repeating said step of sending a committed message until the first agent in the chain has been reached, wherein: data representing commit records to be logged for said first and said subsequent agents is added respectively by each of said first and said subsequent agents to said commit request prior to sending said commit request received from a previous agent in the chain to a next agent in the chain; and said logging of said commit records is completed by the last agent only.
Claim 2
Independent Claim
212 words
A method, for use in a two phase commit protocol between a plurality of agents, each agent having an associated recovery log, of reducing the number of forced writes to recovery logs, the method comprising the steps of: a first agent sending a commit request to a next agent in a chain of agents; each subsequent agent in said chain sending said commit request received from a previous agent in the chain to a next agent in the chain, until a last agent in the chain has been reached; writing by said last agent to its associated recovery log of a commit record indicating that the changes are to be committed; said last agent sending a committed message to a previous agent in a chain of agents; and repeating said step of sending a committed message until the first agent in the chain has been reached, wherein: data representing commit records to be logged for said first and said subsequent agents is added respectively by each of said first and said subsequent agents to said commit request prior to sending said commit request received from a previous agent in the chain to a next agent in the chain; and said logging of said commit records is completed by the last agent only.
Claim 3
Dependent Claim
39 words
A method as claimed in claim 1 wherein, prior to the step of sending a commit request, said first agent and each of said subsequent agents prepares any resources, local to the respective agents, which have already been locked.
Claim 4
Dependent Claim
34 words
A method as claimed in claim 1 wherein, after the committed message is received, said first agent and each of said subsequent agents unlocks any resources, local to the respective agents, which were locked.
Claim 5
Dependent Claim
31 words
A method as claimed in claim 1 wherein, prior to logging by said last agent of a commit record, said last agent prepares any local resources which have already been locked.
Claim 6
Dependent Claim
28 words
A method as claimed in claim 1 wherein, after logging by said last agent of a commit record, said last agent unlocks any local resources which were locked.
Claim 7
Dependent Claim
37 words
A method as claimed in claim 1 wherein, said chain of agents splits into a plurality of chains at an intermediate agent, and said plurality of chains recombines at an intermediate agent or at said last agent.
Claim 8
Dependent Claim
31 words
A method as claimed in claim 6 wherein sending of a committed message to a previous agent in the chain of agents only occurs via one of said plurality of chains.
Claim 9
Dependent Claim
257 words
Data processing apparatus, for use in a two phase commit protocol, wherein the number of forced writes to recovery logs associated with agents participating in said two phase commit protocol is reduced, the apparatus comprising: two or more agents arranged in a chain, each agent having an associated recovery log; means in a first agent in the chain for sending a commit request to a next agent in the chain of agents; means in each agent in the chain for sending said commit request received from a previous agent in the chain to a next agent in the chain, until a last agent in the chain has been reached; means in said last agent for writing to its associated recovery log, a commit record indicating that the changes are to be committed; means in said last agent for sending a committed message to a previous agent in a chain of agents; and means in each agent in the chain for sending said committed request to a previous agent in the chain until said first agent in the chain has been reached, wherein: data representing said commit records to be logged for said first and said subsequent agents is added respectively by each of said first and said subsequent agents to said commit request prior to sending said commit request received from a previous agent in the chain of agents to a next agent in the chain of agents; and commit records are logged only onto a log associated with the last agent in the chain of agents.
Claim 10
Dependent Claim
257 words
Data processing apparatus, for use in a two phase commit protocol, wherein the number of forced writes to recovery logs associated with agents participating in said two phase commit protocol is reduced, the apparatus comprising: two or more agents arranged in a chain, each agent having an associated recovery log; means in a first agent in the chain for sending a commit request to a next agent in the chain of agents; means in each agent in the chain for sending said commit request received from a previous agent in the chain to a next agent in the chain, until a last agent in the chain has been reached; means in said last agent for writing to its associated recovery log, a commit record indicating that the changes are to be committed; means in said last agent for sending a committed message to a previous agent in a chain of agents; and means in each agent in the chain for sending said committed request to a previous agent in the chain until said first agent in the chain has been reached, wherein: data representing said commit records to be logged for said first and said subsequent agents is added respectively by each of said first and said subsequent agents to said commit request prior to sending said commit request received from a previous agent in the chain of agents to a next agent in the chain of agents; and commit records are logged only onto a log associated with the last agent in the chain of agents.
Claim 11
Dependent Claim
38 words
A data processing apparatus as claimed in claim 8 wherein, said chain of agents splits into a plurality of chains at an intermediate agent, and said plurality of chains recombines at an intermediate or at said last agent.
Claim 12
Dependent Claim
33 words
A data processing apparatus as claimed in claim 9 wherein sending of a committed message to a previous agent in the chain of agents only occurs via one of said plurality of chains.
References Cited (Backward Citations)
US5261089A
Cited
US5319774A
Cited
US5319773A
Cited
US5327532A
Cited
US5410684A
Cited
US5613060A
Cited
US5371886A
Cited
US5504900A
Cited
US5581691A
Cited
US5546582A
Cited
US5499364A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-03-30 | 2001-09-29 | 2002-03-31 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-03-30 | 2005-09-29 | 2006-03-31 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-03-30 | 2009-09-29 | 2010-03-31 | $7700.00 | Window Closed / Lapsed |