VISUALIZATION-CENTRIC PERFORMANCE-BASED VOLUME ALLOCATION

• US 20100223619A1
• Filed: 02/27/2009
• Published: 09/02/2010
• Est. Priority Date: 02/27/2009
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: KORUPOLU, Madhukar R., JAQUET, Stefan
• Granted Patent: US 8,214,842 B2
• Time in Patent Office: Days
• US Class Current: 718/104
• CPC Class Codes: G06F 3/04812 Interaction techniques based on cursor appearance or behaviour, e.g. being affected by the presence of displayed objects
• CPC Class Codes: G06F 3/04817 using icons graphical or visual programming using iconic symbols G06F8/34
• CPC Class Codes: G06F 9/5016 the resource being the memory
• CPC Class Codes: H04L 47/70 Admission control; Resource allocation
• CPC Class Codes: H04L 47/83 based on usage prediction
• CPC Class Codes: H04L 67/1097 for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
• CPC Class Codes: H04L 67/568 Storing data temporarily at an intermediate stage, e.g. caching

Abstract

A method, system, and computer program product for visualization-centric performance-based volume allocation in a data storage system using a processor in communication with a memory device is provided. A unified resource graph representative of a global hierarchy of storage components in the data storage system, including each of a plurality of storage controllers, is generated. The unified resource graph includes a common root node and a plurality of subtree nodes corresponding to each of a plurality of nodes internal to the plurality of storage controllers. The common root node and the plurality of subtree nodes are ordered in a top-down orientation. Scalable volume provisioning of an existing or new workload amount by graphical manipulation of at least one of the storage components represented by the unified resource graph is performed based on an input.

Claims

1. A method for visualization-centric performance-based volume allocation in a data storage system using a processor in communication with a memory device, comprising:

generating a unified resource graph representative of a global hierarchy of storage components, including each of a plurality of storage controllers, in the data storage system;

wherein the unified resource graph includes a common root node and a plurality of subtree nodes corresponding to each of a plurality of nodes internal to the plurality of storage controllers, the common root node and the plurality of subtree nodes ordered in a top-down orientation; and

performing scalable volume provisioning of an existing or new workload amount by graphical manipulation of at least one of the storage components represented by the unified resource graph based on an input.

2. The method of claim 1, wherein performing scalable volume provisioning includes performing at least one of allocating at least one volume in the data storage system, preventing a bottleneck impeding data flow between the storage components, and performing a what-if analysis.

3. The method of claim 1, wherein graphical manipulation of at least one of the storage components represented by the unified resource graph includes graphical manipulation of at least one of the at least one volume, a rank, a pool, a device adapter, a cluster processor complex, a host adapter, and one of the plurality of storage controllers.

4. The method of claim 3, further including displaying node information associated with the at least one of the at least one volume, the rank, the pool, the device adapter, the cluster processor complex, the host adapter, and the one of the plurality of storage controllers.

5. The method of claim 1, wherein generating a unified resource graph further includes generating a visual representation of an aggregate summary measure for the common root node and each of the plurality of subtree nodes, wherein the aggregate summary measure includes a gap value corresponding to an estimate of a new workload amount that may be allocated in one or more subtree nodes of the common root node without exceeding performance and space limitations of any of the subtree nodes of the common root node.

6. The method of claim 5, further including, based on the input, dynamically updating the aggregate summary measure and the visual representation thereby.

7. The method of claim 5, wherein generating a visual representation includes generating an icon for display adjacent to each of the common root node and the plurality of subtree nodes.

8. The method of claim 1, further including performing at least one of:

performing at least one of expanding and compressing at least a portion of the common root node and the plurality of subtree nodes based on the input, and

performing at least one of dynamically expanding and compressing at least a portion of the common root node and the plurality of subtree nodes based on one of a number of the plurality of subtree nodes capable of being depicted on a display, a scaling factor, and a cursor position determination.

9. A system for visualization-centric performance-based volume allocation in a data storage system, comprising:

a graphical user interface (GUI) module operational in the data storage system, wherein the GUI module is adapted for;

generating a unified resource graph representative of a global hierarchy of storage components, including each of a plurality of storage controllers, in the data storage system;

wherein the unified resource graph includes a common root node and a plurality of subtree nodes corresponding to each of a plurality of nodes internal to the plurality of storage controllers, the common root node and the plurality of subtree nodes ordered in a top-down orientation, and

performing scalable volume provisioning of an existing or new workload amount by graphical manipulation of at least one of the storage components represented by the unified resource graph based on an input.

10. The system of claim 9, wherein the GUI module is further adapted for performing at least one of allocating at least one volume in the data storage system, preventing a bottleneck impeding data flow between the storage components, and performing a what-if analysis.

11. The system of claim 9, wherein the GUI module is further adapted for graphical manipulation of at least one of the at least one volume, a rank, a pool, a device adapter, a cluster processor complex, a host adapter, and one of the plurality of storage controllers.

12. The system of claim 11, wherein the GUI module is further adapted for displaying node information associated with the at least one of the at least one volume, the rank, the pool, the device adapter, the cluster processor complex, the host adapter, and the one of the plurality of storage controllers.

13. The system of claim 9, wherein the GUI module is further adapted for generating a visual representation of an aggregate summary measure for the common root node and each of the plurality of subtree nodes, wherein the aggregate summary measure includes a gap value corresponding to an estimate of a new workload amount that may be allocated in one or more subtree nodes of the common root node without exceeding performance and space limitations of any of the subtree nodes of the common root node.

14. The system of claim 13, wherein the GUI module is further adapted for, pursuant to the input, dynamically updating the aggregate summary measure and the visual representation thereby.

15. The system of claim 13, wherein the GUI module is further adapted for, pursuant to generating a visual representation, generating an icon for display adjacent to each of the common root node and the plurality of subtree nodes.

16. The system of claim 15, wherein the icon includes a first portion representative of a portion of the aggregate summary measure in use, and a second portion representative of a portion of the aggregate summary measure still available.

17. The system of claim 16, wherein at least one of the first and second portions is color-coded.

18. The system of claim 9, wherein the GUI module is further adapted for:

performing at least one of expanding and compressing at least a portion of the common root node and the plurality of subtree nodes based on the input, and

performing at least one of dynamically expanding and compressing at least a portion of the common root node and the plurality of subtree nodes based on one of a number of the plurality of subtree nodes capable of being depicted on a display, a scaling factor, and a cursor position determination.

19. A computer program product for visualization-centric performance-based volume allocation in a data storage system using a processor in communication with a memory device, the computer program product comprising a computer-readable storage medium having computer-readable program code portions stored therein, the computer-readable program code portions comprising:

a first executable portion for generating a unified resource graph representative of a global hierarchy of storage components, including each of a plurality of storage controllers, in the data storage system;

wherein the unified resource graph includes a common root node and a plurality of subtree nodes corresponding to each of a plurality of nodes internal to the plurality of storage controllers, the common root node and the plurality of subtree nodes ordered in a top-down orientation; and

a second executable portion for performing scalable volume provisioning of an existing or new workload amount by graphical manipulation of at least one of the storage components represented by the unified resource graph based on an input

20. The computer program product of claim 19, wherein the second executable portion for performing scalable volume provisioning includes performing at least one of allocating at least one volume in the data storage system, preventing a bottleneck impeding data flow between the storage components, and performing a what-if analysis.

21. The computer program product of claim 19, further including a third executable portion for displaying node information associated with the at least one of the at least one volume, the rank, the pool, the device adapter, the cluster processor complex, the host adapter, and the one of the plurality of storage controllers.

22. The computer program product of claim 19, wherein the first executable portion for generating a unified resource graph further includes a third executable portion for generating a visual representation of an aggregate summary measure for the common root node and each of the plurality of subtree nodes, wherein the aggregate summary measure includes a gap value corresponding to an estimate of a new workload amount that may be allocated in one or more subtree nodes of the common root node without exceeding performance and space limitations of any of the subtree nodes of the common root node.

23. The computer program product of claim 22, further including a fourth executable portion for, based on the input, dynamically updating the aggregate summary measure and the visual representation thereby.

24. The computer program product of claim 22, further including a fourth executable portion for performing at least one of expanding and compressing at least a portion of the common root node and the plurality of subtree nodes based on the input.

25. The computer program product of claim 22, further including a fourth executable portion for performing at least one of dynamically expanding and compressing at least a portion of the common root node and the plurality of subtree nodes based on one of a number of the plurality of subtree nodes capable of being depicted on a display, a scaling factor, and a cursor position determination.