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

Sharing, updating data blocks among multiple nodes in a distributed system

Assignee: Oracle International Corp
•
Filing: 1997-05-30
•
Granted: 2000-01-04
•
Expires: 2017-05-30
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method for preventing multiple pings. An embodiment of the invention detects requests of data blocks entailing pings likely to cause additional pings. The servicing of requests involving a pings likely to cause additional pings is deferred until a service enabling conditions occurs. Another embodiment of the invention detects situations where by further updating a data block before pinging the data block use of resources on the remote node requesting the data block are reduced. The servicing of the request for the data block is deferred until a service enabling conditions occurs.

Inventors

  • 👤 Juan R. Loaiza
  • 👤 Neil MacNaughton
  • 👤 Roger J. Bamford
  • 👤 William H. Bridge
  • 👤 Boris Klots

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-04 02:41
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/52; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99938; Y10S707/99951; Y10S707/99952; Y10S707/99953

Claims Analysis

Total Claims: 26
Claim 1
Independent Claim 180 words
A method for sharing data among nodes in a distributed system, the method comprising the steps of: receiving a request from a first node for a transfer of a requested data block that currently resides in a second node; detecting that a servicing of said request from said first node will likely cause one or more additional transfers of data between said first node and said second node in addition to the transfer of the requested data block that will be performed in response to servicing said request; in response to detecting that the servicing of said request from said first node will likely cause one or more additional transfers of data between said first node and said second node in addition to the transfer of the requested data block that will be performed in response to servicing said request, deferring said servicing of said request from said first node until a first subset of service enabling conditions occurs; and servicing said request by transferring a copy of the requested data block from said second node to said first node.
Claim 2
Independent Claim 180 words
A method for sharing data among nodes in a distributed system, the method comprising the steps of: receiving a request from a first node for a transfer of a requested data block that currently resides in a second node; detecting that a servicing of said request from said first node will likely cause one or more additional transfers of data between said first node and said second node in addition to the transfer of the requested data block that will be performed in response to servicing said request; in response to detecting that the servicing of said request from said first node will likely cause one or more additional transfers of data between said first node and said second node in addition to the transfer of the requested data block that will be performed in response to servicing said request, deferring said servicing of said request from said first node until a first subset of service enabling conditions occurs; and servicing said request by transferring a copy of the requested data block from said second node to said first node.
Claim 3
Dependent Claim 98 words
The method of claim 1, wherein: the step of detecting that the servicing of said request from said first node will likely cause one or more additional transfers of data between said first node and said second node includes detecting a situation in which it is likely that said second node will perform operations to said data block that have not yet been requested; and said first subset of service enabling conditions includes: receiving a request for said operations to said data block to be performed by said second node, and performing said operations on said second node.
Claim 4
Dependent Claim 77 words
The method of claim 1, wherein: the step of detecting that the servicing of said request from said first node will likely cause one or more additional transfers of data between said first node and said second node includes detecting that said second node will likely perform a block cleanout operation that has not yet been requested; and said first subset of service enabling conditions includes performing said block cleanout operation that has not yet been requested.
Claim 5
Dependent Claim 22 words
The method of claim 1, wherein the said first subset of service enabling conditions includes a lapse of a period of time.
Claim 6
Dependent Claim 74 words
The method of claim 1, wherein: the step of detecting that the servicing of said request from said first node will likely cause one or more additional transfers of data between said first node and said second node includes detecting a situation in which it is likely that said second node will perform block split operations involving said data block; and said first subset of service enabling conditions includes performing said block split operations.
Claim 7
Independent Claim 161 words
A method for sharing data among nodes in a distributed system, the method comprising the steps of: receiving a request from a first node for a transfer of a requested data block that currently resides in a second node; detecting situations wherein said second node can likely reduce use of resources by said first node by performing, prior to transmitting said requested data block to said first node in response to said request, further updates to the requested data block; in response to detecting situations wherein said second node can likely reduce use of resources by said first node by performing, prior to transmitting said requested data block to said first node in response to said request, further updates to the requested data block, deferring a servicing of said request from the first node until a first subset of service enabling conditions occurs; and servicing said request by transferring said requested data block from said second node to said first node.
Claim 8
Independent Claim 161 words
A method for sharing data among nodes in a distributed system, the method comprising the steps of: receiving a request from a first node for a transfer of a requested data block that currently resides in a second node; detecting situations wherein said second node can likely reduce use of resources by said first node by performing, prior to transmitting said requested data block to said first node in response to said request, further updates to the requested data block; in response to detecting situations wherein said second node can likely reduce use of resources by said first node by performing, prior to transmitting said requested data block to said first node in response to said request, further updates to the requested data block, deferring a servicing of said request from the first node until a first subset of service enabling conditions occurs; and servicing said request by transferring said requested data block from said second node to said first node.
Claim 9
Dependent Claim 22 words
The method of claim 6, wherein said first subset of service enabling conditions includes performing further updates to the requested data block.
Claim 10
Dependent Claim 21 words
The method of claim 6, wherein said first subset of service enabling conditions includes a lapse of a period of time.
Claim 11
Dependent Claim 50 words
The method of claim 6, wherein the step of detecting situations wherein said second node can likely reduce use of resources by said first node detecting situations wherein said second node can likely reduce use of resources by said first node by performing block cleanout on the requested data block.
Claim 12
Dependent Claim 22 words
The method of claim 9, wherein said first subset of service enabling conditions includes performing block cleanout on the requested data block.
Claim 13
Dependent Claim 66 words
The method of claim 6, wherein: the step of detecting situations wherein said second node can likely reduce use of resources by said first node includes detecting situations wherein said second node can likely reduce use of resources by said first node by completing block split operations involving the requested data block; and said first subset of service enabling conditions includes performing said block split operations.
Claim 14
Dependent Claim 205 words
A computer readable medium having stored thereon a plurality of sequences of instructions for sharing data among nodes in a distributed system, said plurality of sequences of instructions which, when executed by a processor, cause said processor to perform the steps of: receiving a request from a first node for a transfer of a requested data block that currently resides in a second node; detecting that a servicing of said request from said first node will likely cause one or more additional transfers of data between said first node and said second node in addition to the transfer of the requested data block that will be performed in response to servicing said request; in response to detecting that the servicing of said request from said first node will likely cause one or more additional transfers of data between said first node and said second node in addition to the transfer of the requested data block that will be performed in response to servicing said request, deferring said servicing of said request from said first node until a first subset of service enabling conditions occurs; and servicing said request by transferring a copy of the requested data block from said second node to said first node.
Claim 15
Dependent Claim 205 words
A computer readable medium having stored thereon a plurality of sequences of instructions for sharing data among nodes in a distributed system, said plurality of sequences of instructions which, when executed by a processor, cause said processor to perform the steps of: receiving a request from a first node for a transfer of a requested data block that currently resides in a second node; detecting that a servicing of said request from said first node will likely cause one or more additional transfers of data between said first node and said second node in addition to the transfer of the requested data block that will be performed in response to servicing said request; in response to detecting that the servicing of said request from said first node will likely cause one or more additional transfers of data between said first node and said second node in addition to the transfer of the requested data block that will be performed in response to servicing said request, deferring said servicing of said request from said first node until a first subset of service enabling conditions occurs; and servicing said request by transferring a copy of the requested data block from said second node to said first node.
Claim 16
Dependent Claim 100 words
The computer readable medium of claim 12, wherein: the step of detecting that the servicing of said request from said first node will likely cause one or more additional transfers of data between said first node and said second node includes detecting a situation in which it is likely that said second node will perform operations to said data block that have not yet been requested; and said first subset of service enabling conditions includes: receiving a request for said operations to said data block to be performed by said second node, and performing said operations on said second node.
Claim 17
Dependent Claim 79 words
The computer readable medium of claim 12, wherein: the step of detecting that the servicing of said request from said first node will likely cause one or more additional transfers of data between said first node and said second node includes detecting that said second node will likely perform a block cleanout operation that has not yet been requested; and said first subset of service enabling conditions includes performing said block cleanout operation that has not yet been requested.
Claim 18
Dependent Claim 24 words
The computer readable medium of claim 12, wherein the said first subset of service enabling conditions includes a lapse of a period of time.
Claim 19
Dependent Claim 76 words
The computer readable medium of claim 12, wherein: the step of detecting that the servicing of said request from said first node will likely cause one or more additional transfers of data between said first node and said second node includes detecting a situation in which it is likely that said second node will perform block split operations involving said data block; and said first subset of service enabling conditions includes performing said block split operations.
Claim 20
Dependent Claim 186 words
A computer readable medium having stored thereon a plurality of sequences of instructions for sharing data among nodes in a distributed system, said plurality of sequences of instructions which, when executed by a processor, cause said processor to perform the steps of: receiving a request from a first node for a transfer of a requested data block that currently resides in a second node; detecting situations wherein said second node can likely reduce use of resources by said first node by performing, prior to transmitting said requested data block to said first node in response to said request, further updates to the requested data block; in response to detecting situations wherein said second node can likely reduce use of resources by said first node by performing, prior to transmitting said requested data block to said first node in response to said request, further updates to the requested data block, deferring a servicing of said request from the first node until a first subset of service enabling conditions occurs; and servicing said request by transferring said requested data block from said second node to said first node.
Claim 21
Dependent Claim 186 words
A computer readable medium having stored thereon a plurality of sequences of instructions for sharing data among nodes in a distributed system, said plurality of sequences of instructions which, when executed by a processor, cause said processor to perform the steps of: receiving a request from a first node for a transfer of a requested data block that currently resides in a second node; detecting situations wherein said second node can likely reduce use of resources by said first node by performing, prior to transmitting said requested data block to said first node in response to said request, further updates to the requested data block; in response to detecting situations wherein said second node can likely reduce use of resources by said first node by performing, prior to transmitting said requested data block to said first node in response to said request, further updates to the requested data block, deferring a servicing of said request from the first node until a first subset of service enabling conditions occurs; and servicing said request by transferring said requested data block from said second node to said first node.
Claim 22
Dependent Claim 24 words
The computer readable medium of claim 17, wherein said first subset of service enabling conditions includes said further updates to the requested data block.
Claim 23
Dependent Claim 23 words
The computer readable medium of claim 17, wherein said first subset of service enabling conditions includes a lapse of a period of time.
Claim 24
Dependent Claim 53 words
The computer readable medium of claim 17, wherein the step of detecting situations wherein said second node can likely reduce use of resources by said first node includes detecting situations wherein said second node can likely reduce use of resources by said first node by performing block cleanout on the requested data block.
Claim 25
Dependent Claim 24 words
The computer readable medium of claim 20, wherein said first subset of service enabling conditions includes performing block cleanout on the requested data block.
Claim 26
Dependent Claim 68 words
The computer readable medium of claim 17, wherein: the step of detecting situations wherein said second node can likely reduce use of resources by said first node includes detecting situations wherein said second node can likely reduce use of resources by said first node by completing block split operations involving the requested data block; and said first subset of service enabling conditions includes performing said block split operations.

References Cited (Backward Citations)

US4620276A Cited
US4714992A Cited
US5269020A Cited
US5557792A Cited
US5452445A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2003-01-03 2003-07-05 2004-01-04 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2007-01-03 2007-07-05 2008-01-04 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2011-01-03 2011-07-05 2012-01-04 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag