Integrated placement planning for heterogenous storage area network data centers

• US 8,341,623 B2
• Filed: 05/22/2007
• Issued: 12/25/2012
• Est. Priority Date: 05/22/2007
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Korupolu, Madhukar R., Singh, Aameek, Bamba, Bhuvan, Pandey, Prashant, Voruganti, Kaladhar
• Primary Examiner(s): Rashid, Harunur
• Application Number:
  US11/752,292
• Publication Number:
  US 20080295094A1
• Time in Patent Office: 2,044 Days
• Field of Search: 709/223, 718/1, 718/104, 718/105
• US Class Current: 718/1
• CPC Class Codes: G06F 9/5066 Algorithms for mapping a plurality of inter-dependent sub-tasks onto a plurality of physical CPUs mappping at compile time, see G06F8/451
• CPC Class Codes: G06F 9/5077 Logical partitioning of resources; Management or configuration of virtualized resources specific details on emulation or internal functioning of virtual machines G06F9/455
• CPC Class Codes: H04L 67/1001 for accessing one among a plurality of replicated servers
• CPC Class Codes: H04L 67/1008 based on parameters of servers, e.g. available memory or workload monitoring of computer activity G06F11/30
• CPC Class Codes: H04L 67/101 based on network conditions
• CPC Class Codes: H04L 67/1021 based on client or server locations
• CPC Class Codes: H04L 67/1023 based on a hash applied to IP addresses or costs
• 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]

Abstract

A storage placement planning system receives a resource graph describing SAN'"'"'s resources and virtual machine applications requiring a particular amount of a processing resource element and a storage resource element. The system then determines a coupled placement of the processing element and storage element for each of the applications on a coupled pair of the resource nodes based on a specified throughput and a distance factor between coupled pairs of resource nodes. The coupled placement is determined using an algorithm that implements a cost function that determines affinities between processing nodes and storage nodes for each of said applications of a particular workload. The coupled placement for each of said applications identifies the particular amount of processing resource element placed on a first node for providing a processing resource and the particular amount of storage resource element placed on a second node for providing a storage resource for that application.

Claims

1. A computer program product for storage and processing node placement planning in a virtualized storage area network (SAN) data center environment, the computer program product comprising a non-transitory computer readable storage medium having computer readable program code embodied therewith, said program code being executable by a computer to:

receive a resource graph describing SAN'"'"'s resources, said graph includes a plurality of resource nodes, each of the resource nodes providing one or more resources for virtual machine applications, said applications and the resource nodes being in communication with the SAN, and the SAN'"'"'s resources include processing and storage resources;

receive virtual machine applications, each of said applications requiring a particular amount of a processing resource element and a particular amount of a storage resource element;

determine a coupled placement of the processing element and the storage element for each of said applications on a coupled pair of the resource nodes, using an algorithm that implements a cost function that determines affinities between processing nodes and storage nodes for each of said applications of a particular workload, wherein the algorithm minimizes a cost factor of the cost function, wherein said determining the coupled placement is based on a specified throughput and a distance factor between the coupled pairs of resource nodes;

wherein, said coupled placement for each of said applications identifies the particular amount of processing resource element placed on a first node for providing a processing resource and the particular amount of storage resource element placed on a second node for providing a storage resource for that application, the first node and the second node being connected as a coupled pair, and determining said coupled placement is performed with different coupled pairs having varying degrees of affinity; and

compare, said coupled placement for each of said applications, based upon the cost function applied to particular application item placements on particular coupled nodes.

2. The computer program product of claim 1, wherein said algorithm is a individual greedy algorithm.

3. The computer program product of claim 1, wherein said algorithm is a pair greedy algorithm.

4. The computer program product of claim 1, wherein said algorithm is a stable marriage algorithm.

5. The computer program product of claim 1, wherein determining said coupled placement is performed with the coupled pair of the plurality of connected resource nodes of the SAN having a distance factor with respect to each other.

6. The computer program product of claim 1, wherein determining said coupled placement is performed with said applications requiring a specified throughput between the coupled pair of the plurality of connected resource nodes of the SAN.

7. The computer program product of claim 1, further comprising modifying results of the comparison based on specified hardware information of the resource nodes.

8. The computer program product of claim 1, wherein the coupled placement is outputted as a data center placement plan of storage and processing resources for each applications in a particular workload.

9. A method of storage and processing node placement planning in a virtualized storage area network (SAN) data center environment, comprising:

receiving a resource graph describing SAN'"'"'s resources, said graph includes a plurality of resource nodes, each of the resource nodes providing one or more resources for virtual machine applications, said applications and the resource nodes being in communication with the SAN, and the SAN'"'"'s resources include processing and storage resources;

receiving virtual machine applications, each of said applications requiring a particular amount of a processing resource element and a particular amount of a storage resource element;

determining a coupled placement of the processing element and the storage element for each of said applications on a coupled pair of the resource nodes, using an algorithm that implements a cost function that determines affinities between processing nodes and storage nodes for each of said applications of a particular workload, wherein the algorithm minimizes a cost factor of the cost function, wherein said determining the coupled placement is based on a specified throughput and a distance factor between the coupled pairs of resource nodes;

wherein, said coupled placement for each of said applications identifies the particular amount of processing resource element placed on a first node for providing a processing resource and the particular amount of storage resource element placed on a second node for providing a storage resource for that application, the first node and the second node being connected as a coupled pair, and determining said coupled placement is performed with different coupled pairs having varying degrees of affinity; and

comparing, said coupled placement for each of said applications, based upon the cost function applied to particular application item placements on particular coupled nodes.

10. The method of claim 9, wherein said algorithm is selected from the group consisting of:

a individual greedy algorithm, a pair greedy algorithm, and a stable marriage algorithm.

11. The method of claim 9, wherein determining said coupled placement is performed with the coupled pair of the plurality of connected resource nodes of the SAN having a distance factor with respect to each other.

12. The method of claim 9, wherein determining said coupled placement is performed with said applications requiring a specified throughput between the coupled pair of the plurality of connected resource nodes of the SAN.

13. The method of claim 9, wherein the resource nodes include networked computer devices selected from the group consisting of:

host computers, switches, fabric nodes and storage subsystems of the SAN.

14. The method of claim 9, further comprising modifying results of the comparison based on specified hardware information of the resource nodes.

15. The method of claim 9, wherein the coupled placement is outputted as a data center placement plan of storage and processing resources for each applications in a particular workload.

16. A storage placement planning system for virtualized storage area network (SAN) data center environments, comprising:

a processor;

a memory;

the memory store executable instructions that when executable by the processor to perform;

receiving a resource graph describing SAN'"'"'s resources, said graph includes a plurality of resource nodes, each of the resource nodes providing one or more resources for virtual machine applications, said applications and the resource nodes being in communication with the SAN, and the SAN'"'"'s resources include processing and storage resources;

receiving virtual machine applications, each of said applications requiring a particular amount of a processing resource element and a particular amount of a storage resource element;

determining a coupled placement of the processing element and the storage element for each of said applications on a coupled pair of the resource nodes, using an algorithm that implements a cost function that determines affinities between processing nodes and storage nodes for each of said applications of a particular workload, wherein the algorithm minimizes a cost factor of the cost function, wherein said determining the coupled placement is based on a specified throughput and a distance factor between the coupled pairs of resource nodes;

wherein, said coupled placement for each of said applications identifies the particular amount of processing resource element placed on a first node for providing a processing resource and the particular amount of storage resource element placed on a second node for providing a storage resource for that application, the first node and the second node being connected as a coupled pair, and determining said coupled placement is performed with different coupled pairs having varying degrees of affinity; and

comparing, said coupled placement for each of said applications, based upon the cost function applied to particular application item placements on particular coupled nodes.

17. The system of claim 16, wherein said algorithm is selected from the group consisting of:

a individual greedy algorithm, a pair greedy algorithm, and a stable marriage algorithm.

18. The system of claim 16, wherein said determines the coupled placement is performed with the coupled pair of the plurality of connected resource nodes of the SAN having a distance factor with respect to each other.

19. The system of claim 16, wherein determines said coupled placement is performed with said applications requiring a specified throughput between the coupled pair of the plurality of connected resource nodes of the SAN.

20. The system of claim 16, wherein the resource nodes include networked computer devices selected from the group consisting of:

host computers, switches, fabric nodes and storage subsystems of the SAN.

21. The system of claim 16, wherein the processor modifies results of the comparison based on specified hardware information of the resource nodes.

22. The system of claim 16, wherein the coupled placement is outputted as a data center placement plan of storage and processing resources for each applications in a particular workload.