← Back to Patent Explorer
US5550973A Expired / Lapsed US ⏱️ 0.0 years remaining

System and method for failure recovery in a shared resource system having a moving write lock

Assignee: International Business Machines Corp
•
Filing: 1995-03-15
•
Granted: 1996-08-27
•
Expires: 2015-03-15
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract The system and method of the present invention provides for recovery from failure of a distributed processing system process designated as a master process for at least one shared resource. The system of the invention provides for detection of the failure by one or more of the shadow processes. The detecting process tests to determine whether it has the shared write lock managed by the master process. If it does, it becomes the master process. If not, it determines from the shared control file which process holds the write lock and it communicates to that process a request to assume master process responsibilities.

Inventors

  • 👤 Ira R. Forman
  • 👤 Hari H. Madduri

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-01 07:41
CPC Classifications
G; G11; G11C; G11C29/00; G11C29/70; G11C29/74; G06; G06F; G06F11/00; G06F11/07; G06F11/14; G06F11/1402; G06F11/1415; G06F11/142

Claims Analysis

Total Claims: 4
Claim 1
Independent Claim 384 words
In a computer network that includes a plurality of processing nodes, a method for distributing control of a write lock for a shared data object from, a master processing node currently in control of the write lock, to one of the plurality of processing nodes requesting use of the write lock upon failure of the master processing node wherein the master processing node fails to transfer the write lock to the processing node requesting use of the write lock, the method comprising the following steps in the sequence set forth: detecting by the processing node requesting use of the write lock, when the master processing node fails to transfer the write lock to the processing node requesting use of the write lock; determining, by the processing node requesting use of the write lock, whether the processing node requesting use of the write lock holds the write lock for the shared data object; when the processing node requesting use of the write lock holds the write lock, requesting that the processing node requesting use of the write lock assume control over the write lock for that shared data object from the master processing node failing to transfer use of the write lock for that shared data object to establish a new master processing node for that shared data object; when the processing node requesting use of the write lock does not hold the write lock for the shared data object, determining whether another processing node of the plurality of processing nodes holds the write lock for the shared data object; when the another processing node holds the write lock for the shared data object, requesting that the another processing node assume control over the write lock for that shared data object from the master processing node failing to transfer use of the write lock for that shared data object to establish a new master processing node for that shared data object; and when the another processing node fails to assume control of the write lock, executing a race among the plurality of processing nodes for control of the write lock for that shared data object from the master processing node failing to transfer use of the write lock for that shared data object to establish a new master processing node for that shared data object.
Claim 2
Dependent Claim 384 words
In a computer network that includes a plurality of processing nodes, a method for distributing control of a write lock for a shared data object from, a master processing node currently in control of the write lock, to one of the plurality of processing nodes requesting use of the write lock upon failure of the master processing node wherein the master processing node fails to transfer the write lock to the processing node requesting use of the write lock, the method comprising the following steps in the sequence set forth: detecting by the processing node requesting use of the write lock, when the master processing node fails to transfer the write lock to the processing node requesting use of the write lock; determining, by the processing node requesting use of the write lock, whether the processing node requesting use of the write lock holds the write lock for the shared data object; when the processing node requesting use of the write lock holds the write lock, requesting that the processing node requesting use of the write lock assume control over the write lock for that shared data object from the master processing node failing to transfer use of the write lock for that shared data object to establish a new master processing node for that shared data object; when the processing node requesting use of the write lock does not hold the write lock for the shared data object, determining whether another processing node of the plurality of processing nodes holds the write lock for the shared data object; when the another processing node holds the write lock for the shared data object, requesting that the another processing node assume control over the write lock for that shared data object from the master processing node failing to transfer use of the write lock for that shared data object to establish a new master processing node for that shared data object; and when the another processing node fails to assume control of the write lock, executing a race among the plurality of processing nodes for control of the write lock for that shared data object from the master processing node failing to transfer use of the write lock for that shared data object to establish a new master processing node for that shared data object.
Claim 3
Dependent Claim 36 words
The method of claim 1 wherein the step of determining whether the another processing node holds the write lock further comprises accessing, by the processing node, a shared control file to identify the another processing node.
Claim 4
Dependent Claim 33 words
The method of claim 1 further comprising the step of, when the processing node is currently holding the write lock, assuming, by the processing node, the master responsibility for the shared data object.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1999-08-27 2000-02-26 2000-08-27 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2003-08-27 2004-02-26 2004-08-27 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2007-08-27 2008-02-26 2008-08-27 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag