Landscape reorganization algorithm for dynamic load balancing

• US 20070234366A1
• Filed: 03/28/2006
• Published: 10/04/2007
• Est. Priority Date: 03/28/2006
• Status: Active Grant

• Current Assignee: SAP SE
• Original Assignee: SAP AG (SAP SE)
• Inventors: Morich, Kai, Leonkev, Vladislav, Rebholz, Oliver
• Granted Patent: US 8,127,299 B2
• Time in Patent Office: Days
• US Class Current: 718/104
• CPC Class Codes: G06F 9/5083 Techniques for rebalancing the load in a distributed system

Abstract

A method and system for reorganizing a distributed computing landscape for dynamic load balancing is presented. A method includes the steps of collecting information about resource usage by a plurality of hosts in a distributed computing system, and generating a target distribution of the resource usage for the distributed computing system. The method further includes the step of generating an estimate of an improvement of the resource usage according to a reorganization plan.

Claims

1. A computer-implemented method comprising:

collecting information about resource usage by a plurality of hosts in a distributed computing system;

generating a target distribution of the resource usage for the distributed computing system; and

generating an estimate of an improvement of the resource usage according to a reorganization plan.

2. A method in accordance with claim 1, further comprising executing the reorganization plan on the distributed computing system.

3. A method in accordance with claim 1, wherein the information includes static information and dynamic information.

4. A method in accordance with claim 3, wherein the static information includes a total size of objects hosted by each host.

5. A method in accordance with claim 3, wherein the dynamic information includes a measure of a central processing unit (CPU) usage per a predetermined interval.

6. A method in accordance with claim 1, wherein the information about the resource usage is an estimate based on comparative values measured at particular times or intervals.

7. A method in accordance with claim 1, wherein the target distribution further comprises:

minimizing memory usage of the distributed computing system; and

minimizing CPU usage of the distributed computing system.

8. A method in accordance with claim 7, wherein minimizing CPU usage of the distributed computing system further includes minimizing CPU usage at selected hosts of the distributed computing system.

9. A method in accordance with claim 1, further comprising sorting objects by size on the plurality of hosts in the distributed computing system.

10. A method in accordance with claim 9, further comprising defining large objects and small objects based on the sorting of objects by size.

11. A computer-implemented method for reorganizing a distributed computing landscape comprising a plurality of hosts, the method comprising:

creating a target data structure that is similar to a current data structure but representing the plurality of hosts as empty of objects;

forming two groups of objects based on large objects and small objects of the current data structure; and

reorganizing the current data structure according to selection of new hosts for the large objects and small objects based on memory and central processing unit (CPU) values.

12. A method in accordance with claim 11, wherein reorganizing the target data structure includes selecting a host having large objects and having the lowest memory and CPU values.

13. A method in accordance with claim 11, wherein reorganizing the target data structures includes selecting a host having small objects and having the lowest number of objects.

14. A method in accordance with claim 11, further comprising executing the reorganizing.

15. A computer program product tangibly embodied in an information carrier, the computer program product including instructions that, when executed, perform operations comprising:

collect information about resource usage by a plurality of hosts in a distributed computing system;

generate a target distribution of the resource usage for the distributed computing system; and

generate an estimate of an improvement of the resource usage according to a reorganization plan.

16. A computer program product in accordance with claim 15, further comprising executing the reorganization plan on the distributed computing system.

17. A computer program product in accordance with claim 15, wherein the information includes static information and dynamic information.

18. A computer program product in accordance with claim 17, wherein the static information includes a total size of objects hosted by each host.

19. A computer program product in accordance with claim 17, wherein the dynamic information includes a measure of a central processing unit (CPU) usage per a predetermined interval.

20. A computer program product in accordance with claim 15, further comprising instructions that, when executed, perform operations comprising:

minimize memory usage of the distributed computing system; and

minimize CPU usage of the distributed computing system.