Optimizing memory usage across multiple garbage collected computer environments

Patent metadata

Field	Value
Publication number	US-9836394-B2
Application number	US-201615272948-A
Country	US
Kind code	B2
Filing date	Sep 22, 2016
Priority date	Jul 18, 2013
Publication date	Dec 5, 2017
Grant date	Dec 5, 2017

Abstract

A method, information processing system, and computer readable storage medium, vary a maximum heap memory size for one application of a plurality of applications based on monitoring garbage collection activity levels for the plurality of applications, each application including a heap memory, and unused memory in the heap memory being reclaimed by a garbage collector.

First claim

What is claimed is:

1. In a system comprised of a plurality of applications wherein each application includes a heap memory wherein unused memory in the heap memory is reclaimed by a garbage collector, a method for improving memory allocation comprising the steps of:
determining a level of garbage collection activity of each application; and
in response to a first application exhibiting a high level of garbage collection activity, increasing a maximum heap memory of the application.

2. The method of claim 1 , further comprising the step of:
decreasing a maximum heap memory of at least one second application exhibiting a lower level of garbage collection activity than the first application.

3. The method of claim 1 , further comprising the step of:
periodically monitoring the plurality of applications for level of garbage collection activity of each application including a maximum heap memory size and a garbage collection activity level; and
in response to the garbage collection activity level for an application exceeding a threshold, increasing the maximum heap memory size for the application.

4. The method of claim 1 , further comprising the step of:
in response to the garbage collection activity level for an application falling below a threshold and free memory in the system falling below a threshold, reducing the maximum heap memory size for the application.

5. The method of claim 1 , further comprising the step of:
making a decision to vary a maximum heap memory size for an application based on a distribution of garbage collection activity levels for a plurality of applications.

6. The method of claim 5 , further comprising the step of:
increasing a maximum heap memory size for an application with a garbage collection activity level significantly above a mean for the distribution.

7. The method of claim 5 , further comprising the step of:
decreasing a maximum heap memory size for an application with a garbage collection activity level significantly below a mean for the distribution.

8. The method of claim 1 , in which a garbage collection activity level of an application is weighted by a numerical value, in which the numerical value is correlated with heap memory size, total memory size, priority, or service level associated with an application.

9. The method of claim 1 , further comprising the step of:
making a decision to vary a maximum heap memory size for an application based on historical profile information.

10. The method of claim 9 , further comprising the step of:
making a decision to vary a maximum heap memory size for an application based on analyzing historical profile information to determine how much garbage collection activity levels vary with heap size.

11. The method of claim 1 , further comprising the step of:
making a decision to vary a maximum heap memory size for an application based on analyzing historical profile information to predict memory size requirements for the application in the future.

12. The method of claim 1 , in which at least one application corresponds to at least one Java virtual machine.

13. The method of claim 1 , in which a garbage collection activity level of an application is determined by considering a frequency of garbage collections or a frequency of compacting garbage collections.

14. The method of claim 1 , in which a garbage collection activity level of an application is determined by considering a frequency of garbage collections or a frequency of compacting garbage collections divided by a processing time associated with the application.

15. The method of claim 1 , further comprising the step of:
in response to the garbage collection activity level for an application falling below a threshold, reducing the maximum heap memory size for the application.

16. An information processing system comprising:
a memory;
a processor communicatively coupled to the memory;
a garbage collector communicatively coupled to the processor and the memory; and
a system monitor communicatively coupled to the processor and the memory, wherein each of a plurality of applications while running on the information processing system including a heap memory wherein unused memory in the heap memory is reclaimed by the garbage collector, and wherein the processor, responsive to executing computer instructions, performs operations comprising:
determining a level of garbage collection activity of each application; and
in response to a first application exhibiting a high level of garbage collection activity, increasing a maximum heap memory of the application.

17. The information processing system of claim 16 , wherein the processor, responsive to executing the computer instructions, performs operations comprising:
decreasing a maximum heap memory of at least one second application exhibiting a lower level of garbage collection activity than the first application.

18. The information processing system of claim 16 , wherein the processor, responsive to executing the computer instructions, performs operations comprising:
periodically monitoring the plurality of applications for level of garbage collection activity of each application including a maximum heap memory size and a garbage collection activity level; and
in response to the garbage collection activity level for an application exceeding a threshold, increasing the maximum heap memory size for the application.

19. A computer readable storage medium, comprising computer instructions which, responsive to being executed by a processor cause the processor to perform operations, the processor being in an information processing system comprised of a memory communicatively coupled with the processor, a garbage collector communicatively coupled to the processor and the memory, wherein each of a plurality of applications while running on the information processing system including a heap memory wherein unused memory in the heap memory is reclaimed by the garbage collector, and wherein the processor, responsive to executing the computer instructions, performs operations comprising:
determining a level of garbage collection activity of each application; and
in response to a first application exhibiting a high level of garbage collection activity, increasing a maximum heap memory of the application.

20. The computer readable storage medium of claim 19 , wherein the processor, responsive to executing computer instructions, performs operations comprising:
decreasing a maximum heap memory of at least one second application exhibiting a lower level of garbage collection activity than the first application.

Assignees

• IBM

Inventors

• Bobroff Norman
• Iyengar Arun
• Westerink Peter

Classifications

• G06F12/0253 Primary

  Garbage collection, i.e. reclamation of unreferenced memory · CPC title

• G06F3/0673

  Single storage device · CPC title

• G06F3/0631

  by allocating resources to storage systems · CPC title

• G06F3/0608

  Saving storage space on storage systems · CPC title

• G06F3/0604

  Improving or facilitating administration, e.g. storage management · CPC title