Optimizing memory usage across multiple applications based on garbage collection activity

Patent metadata

Field	Value
Publication number	US-10198351-B2
Application number	US-201715792865-A
Country	US
Kind code	B2
Filing date	Oct 25, 2017
Priority date	Jul 18, 2013
Publication date	Feb 5, 2019
Grant date	Feb 5, 2019

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:
periodically monitoring each of the plurality of applications for a maximum heap memory size and a garbage collection activity;
maintaining historical profile information on at least one monitored past garbage collection activity; and
varying the maximum heap memory size for an application based on the historical profile information on at least one monitored past garbage collection activity.

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

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

4. 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.

5. The method of claim 4 , 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.

6. The method of claim 4 , 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.

7. The method of claim 1 , in which a garbage collection activity level of an application is weighted by a numerical value.

8. The method of claim 7 , 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 analyzing historical profile information to determine how much garbage collection activity levels vary with heap size.

10. 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.

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

12. 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.

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 divided by a processing time associated with the application.

14. The method of claim 1 , further comprising the step of: in response to the garbage collection activity level for an application being monitored exceeding a threshold, increasing the maximum heap memory size for the application.

15. 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:
periodically monitoring each of the plurality of applications for a maximum heap memory size and a garbage collection activity;
maintaining historical profile information on at least one monitored past garbage collection activity; and
varying the maximum heap memory size for an application based on the historical profile information on at least one monitored past garbage collection activity.

16. The information processing system of claim 15 , wherein the processor, responsive to executing the computer instructions, performs operations comprising:
in response to the garbage collection activity level for an application being monitored falling below a threshold, reducing the maximum heap memory size for the application.

17. The information processing system of claim 15 , wherein the processor, responsive to executing the computer instructions, performs operations comprising:
in response to the garbage collection activity level for an application being monitored falling below a threshold and free memory in the system being monitored falling below a threshold, reducing the maximum heap memory size for the application.

18. The information processing system of claim 15 , wherein the processor, responsive to executing the computer instructions, performs operations comprising:
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.

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:
periodically monitoring each of the plurality of applications for a maximum heap memory size and a garbage collection activity;
maintaining historical profile information on at least one monitored past garbage collection activity; and
varying the maximum heap memory size for an application based on the historical profile information on at least one monitored past garbage collection activity.

20. The computer readable storage medium of claim 19 , wherein the processor, responsive to executing computer instructions, performs operations comprising:
in response to the garbage collection activity level for an application being monitored falling below a threshold, reducing the maximum heap memory size for the application.

Assignees

• IBM

Inventors

• Bobroff Norman
• Iyengar Arun
• Westerink Peter

Classifications

• G06F3/0652

  Erasing, e.g. deleting, data cleaning, moving of data to a wastebasket · CPC title

• G06F2212/1044

  Space efficiency improvement · CPC title

• G06F3/0673

  Single storage device · CPC title

• G06F3/0608

  Saving storage space on storage systems · CPC title

• G06F3/0631

  by allocating resources to storage systems · CPC title