Patent US5325528A successfully refreshed from Google Patents.
US5325528A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Distributed computation recovery management system and method
Assignee: Hewlett Packard Development Co LP
•
Filing: 1993-04-22
•
Granted: 1994-06-28
•
Expires: 2013-04-22
Abstract
Abstract A protocol analysis system is provided with data specifying the defined states of processes participating in a distributed computation. State transitions between states are specified as being enabled by (A) receiving a message, (B) unreliably sending a message, or (C) performing an external action such as reliably sending a message. The specification data also identifies process states known to be final states, and all other states are initially denoted as intermediate states. The protocol analysis system determines if any intermediate states can be re-categorized as final states. Then it determines if any state transitions initially identified as unreliable send operations must be treated as derived external actions, and thus made reliable. Thirdly, for each derived external action, the states of the affected application process must be re-evaluated so as to determine if derived final states need to be converted into intermediate states. The resulting determinations as to which states are final states and which messages must be reliable sent are recorded and used to govern execution of the application process. When executing the application process, state transitions entering and leaving intermediate states are normally recorded on stable storage before the state transition is carried out and reliably sent messages are normally recorded on stable storage before being sent. A number of run-time journal optimization techniques reduce the number of state transitions and messages that need to be stored on stable storage.
Inventors
- 👤 Johannes Klein
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-30 17:36
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/07; G06F11/14; G06F11/1402; G06F11/1415; G06F11/1417; H; H04; H04L; H04L9/00; H04L9/40
Claims Analysis
Total Claims: 6
Claim 1
Independent Claim
293 words
In a computer system having multiple application processes that interactively perform a distributed computation, the steps of the method comprising: modeling said multiple application processes as finite state machines by storing in a computer memory in said computer system model data corresponding to each application process, said model data identifying a set of states, identifying some states of said application process as final states from which the corresponding application process is allowed to terminate and identifying other states as intermediate states from which the corresponding application process must not be allowed to terminate; said stored model data for each application process further including state transition data identifying state transitions between identified states of said each application process as being enabled by receiving a message from another application process, by unreliably sending a message to a destination external of said each application process, and by reliably sending a message to a destination external of said each application process; said computer system modifying said model data by selecting, in accordance with a set of predefined state transition modification criteria, ones of said state transitions enabled by unreliably sending a message, and changing said state transition data to indicate that selected state transitions are enabled by reliably sending said message; said computer system further modifying said model data by converting ones of said intermediate states into final states, said intermediate states converted into final states being selected in accordance with a predefined set of state modification criteria; and said computer system when executing each application process, recording on stable storage information identifying reliably sent messages and information identifying state transitions by said each application process, said identifying information being recorded in accordance with which states are identified as being intermediate states in said modified model data.
Claim 2
Dependent Claim
293 words
In a computer system having multiple application processes that interactively perform a distributed computation, the steps of the method comprising: modeling said multiple application processes as finite state machines by storing in a computer memory in said computer system model data corresponding to each application process, said model data identifying a set of states, identifying some states of said application process as final states from which the corresponding application process is allowed to terminate and identifying other states as intermediate states from which the corresponding application process must not be allowed to terminate; said stored model data for each application process further including state transition data identifying state transitions between identified states of said each application process as being enabled by receiving a message from another application process, by unreliably sending a message to a destination external of said each application process, and by reliably sending a message to a destination external of said each application process; said computer system modifying said model data by selecting, in accordance with a set of predefined state transition modification criteria, ones of said state transitions enabled by unreliably sending a message, and changing said state transition data to indicate that selected state transitions are enabled by reliably sending said message; said computer system further modifying said model data by converting ones of said intermediate states into final states, said intermediate states converted into final states being selected in accordance with a predefined set of state modification criteria; and said computer system when executing each application process, recording on stable storage information identifying reliably sent messages and information identifying state transitions by said each application process, said identifying information being recorded in accordance with which states are identified as being intermediate states in said modified model data.
Claim 3
Dependent Claim
70 words
The method of claim 1, said recording step including: said computer system identifying, in accordance with a predefined set of journalling optimization criteria, states of each application process that can be asynchronously journalled and identifying other states of each application process that require synchronous journalling; and said computer system synchronously journalling said states identified as requiring synchronous journalling and asynchronously journalling said states identified as being capable of journalled asynchronously;
Claim 4
Dependent Claim
57 words
The method of claim 2, said recording step further including: said computer system identifying a sequence of more than two states, including identifying a first state and a last state in said sequence of states, that meet predefined journalling avoidance criteria; said computer system journalling only said identified first and last states of said sequence of states.
Claim 5
Dependent Claim
50 words
The method of claim 3, said recording step further including: said computer system, when said identified sequence of states includes at least one state transition enabled by reliably sending a message, delaying journalling of said last state until receipt of said reliably sent message has been acknowledged by its recipient.
Claim 6
Dependent Claim
58 words
The method of claim 4, said recording step further including: said computer system, when said identified sequence of states includes at least one state transition enabled by receiving a reliably sent message for another application process, delaying sending an acknowledgement of receiving said reliably sent message to said other application process until said last state has been journalled.
References Cited (Backward Citations)
US5038307A
Cited
US5220668A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-06-27 | 1997-12-27 | 1998-06-28 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-06-27 | 2001-12-27 | 2002-06-28 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-06-27 | 2005-12-27 | 2006-06-28 | $7700.00 | Window Closed / Lapsed |