Disaggregated resources and access methods

• US 8,819,092 B2
• Filed: 08/16/2005
• Issued: 08/26/2014
• Est. Priority Date: 08/16/2005
• Status: Expired

• Current Assignee: Rateze Remote Mgmt. L.L.C. (Intellectual Ventures LLC)
• Original Assignee: Rateze Remote Mgmt. L.L.C. (Intellectual Ventures LLC)
• Inventors: Ludwig, Thomas Earl, Adams, Mark
• Primary Examiner(s): Chau, Dung K
• Application Number:
  US11/205,895
• Publication Number:
  US 20070043771A1
• Time in Patent Office: 3,297 Days
• Field of Search: 714/4, 709/226, 705/35, 711/146, 711/173
• US Class Current: 707/827
• CPC Class Codes: H04L 61/457 containing identifiers of data entities on a computer, e.g. file names
• CPC Class Codes: H04L 61/5014 using dynamic host configuration protocol [DHCP] or bootstrap protocol [BOOTP]

Abstract

Disaggregated resources distributed among resource nodes provide access to resource consumers by offering resource node information to the resource consumers. Resource node information supplied by each individual resource node comprises incomplete information with respect to the complete disaggregated resource. Resource consumers collect resource node information to create maps of the disaggregated resource, ensure coherency, or manage the disaggregated resource.

Claims

1. A method comprising:

transmitting a discovery request to each of a plurality of resource nodes that each have a unique Internet protocol address and, collectively, present a logical representation of a plurality of physical resources;

receiving, from one or more resource nodes of the plurality of resource nodes, node information that includes a name for each of the one or more resource nodes; and

determining, from the names of each of the one or more resource nodes, an organizational structure of the plurality of resource nodes, the organizational structure being a parallel structure that will provide a resource consumer with access to a first data block of a data set stored on the plurality of physical resources through at least two resource nodes, or a serial structure that will provide the resource consumer with access to the first data block through a first resource node and access to a second data block, which is consecutive with the first data block, of the data set through a second resource node.

2. The method of claim 1, wherein the one or more resource nodes is less than the plurality of resource nodes.

3. The method of claim 1, further comprising:

determining a coherency of a disaggregated resource that includes the plurality of resource nodes based at least in part on the node information received from the one or more resource nodes.

4. The method of claim 3, wherein the node information includes a name for each of the one or more resource nodes, and said determining a coherency of the disaggregated resource is based at least in part on the names of each of the one or more resource nodes.

5. The method of claim 4, wherein the node information further includes a coherency attribute and said determining the coherency of the disaggregated resource is further based at least in part on the coherency attribute.

6. The method of claim 5, wherein the organizational structure of the plurality of resource nodes includes a sequence of the plurality of resource nodes and the coherency attribute of a resource node of the one or more resource nodes is indicative of an additional resource node of the plurality of resource nodes that is later in the sequence.

7. The method of claim 1, further comprising:

generating a resource map to correspond one or more logical resource element identifiers to each of the plurality of resource nodes.