Disaggregated resources and access methods

• US 20070043771A1
• Filed: 08/16/2005
• Published: 02/22/2007
• Est. Priority Date: 08/16/2005
• Status: Active Grant

• 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, Adams, Mark
• Granted Patent: US 8,819,092 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• 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 disaggregated resource spread among a least a first and second resource node, wherein the first and second resource node are distinguishable from each other and are both responsive to a resource discovery request by providing resource node information from which a resource consumer creates a resource map in a first memory, wherein the resource node information stored in a second memory from an individual one of the first and second resource node is incomplete with respect to the complete resource map.

2. The resource of claim 1, wherein the resource node information further comprises a resource node name.

3. The resource of claim 2, wherein the resource node name is a unique name.

4. The resource of claim 2, wherein the resource node name resolves to an internetworking protocol address.

5. The resource of claim 4, wherein the internetworking protocol address is a multicast address.

6. The resource of claim 1, wherein the resource node information further comprises a resource node group type.

7. The resource of claim 6, wherein the resource node group type includes at least one of a mirror, stripe, span, parity, composite, archive, or individual type.

8. The resource of claim 1, wherein the resource node information further comprises a resource node attribute.

9. The resource of claim 8, wherein the resource node attribute is a resource valid attribute

10. The resource of claim 8, wherein the resource node attribute is a resource member attribute.

11. The resource of claim 1, wherein the resource map comprises a granularity at a resource partition level that is below the resource level.

12. The resource of claim 11, wherein the resource map further comprises a granularity at a resource element level that is below the resource partition level.

13. The resource of claim 1, wherein the resource map further comprises split resource map comprising a first resource sub-map stored in first memory and a second resource sub-map stored in a second memory.

14. The resource of claim 1, wherein the resource map created by the resource consumer is different than a second resource map created by a second resource consumer.

15. The resource of claim 1, wherein the resource further comprises a storage medium.

16. The resource of claim 1, wherein the resource further comprises a video display.

17. The resource of claim 1, wherein the resource further comprises a processing unit.

18. The resource of claim 1, wherein the resource further comprises a memory.

19. The resource of claim 1, wherein the resource consumer and at least one of the first and second resource nodes communicate with each other over an unreliable communication path.

20. A method of accessing a disaggregated resource spread among at least a first and second resource node, wherein the first and second resource node are distinguishable and are both responsive to requests from a resource consumer by providing their individual resource node information stored in a first memory, said method comprising:

(a) Organizing the at least first and second resource nodes into an organizational structure that is understandable by the resource consumer;

(b) Assigning the resource node information to the at least first and second resource node wherein the resource node information is based on the organizational structure;

(c) Assessing disaggregated resource coherency based on the resource node information from the at least first and second resource node; and

(d) Sending resource requests to the disaggregated resource.

21. The method of claim 20, wherein the resource node information comprises resource node group type.

22. The method of claim 21, wherein the resource node group type includes at least one of the following group types mirror, stripe, span, parity, composite, archive, and individual type

23. The method of claim 20, wherein the resource node information comprise a resource node attribute.

24. The method of claim 23, wherein the resource node attribute comprise a resource member attribute.

25. The method of claim 23, wherein the resource node attribute comprise a resource valid attribute.

26. The method of claim 25, further comprising modifying the resource valid attribute upon detection of loss of disaggregated resource coherency.

27. The method of claim 20, wherein the resource node information comprises a resource node name.

28. The method of claim 27, wherein the resource node name comprises a name associated with the disaggregated resource.

29. The method of claim 20 further comprising discovering the disaggregated resource by sending a discovery request to the disaggregated resource and collecting responses that comprise the resource node information from at least one of the at least first and second resource node.

30. The method of claim 29, further comprising creating a resource map in a second memory of the disaggregated resource based on the resource node information.

31. The method of claim 20, further comprising periodically assessing the coherency of the disaggregated resource.

32. The method of claim 31, wherein the period of checking occurs at a frequency of at least 10 seconds.

33. The method of claim 20, further comprising bypassing a communication stack of the at least first and second resource node to facilitate responsiveness to the requests.

34. The method of claim 20, further comprising generating access faults in response to the requests.

35. The method of claim 20, further comprising sending a proxy command from the first resource node to the second resource node.

36. A split resource map of a disaggregated resource spread among at least a first and second resource node, said map comprising:

(a) a first resource sub-map stored in a first memory, and

(b) a second resource sub-map stored in a second memory.

37. The resource map of claim 36, wherein the first resource sub-map comprises an address directed to the memory storing the second resource sub-map.

38. The resource map of claim 36, wherein the resource map comprises a granularity at a physical resource partition level that is below the physical resource level.

39. The resource map of claim 38, wherein the resource map further comprises a granularity at a physical resource element level that is below the physical resource partition level.