# US 2018/0322048 A1 · Coordinating heap contraction of multiple runtimes in the cloud environment

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2018/0322048 A1
- Document ID: US20180322048A1
- Status: Published application
- Kind: A1
- Application number: 15/812,504
- Filed: 2017-11-14
- Published: 2018-11-08
- Earliest claimed: 2017-05-08
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Michihiro Horie; Hiroshi H. Horii; Kazunori Ogata
- Web page: https://patentgrep.com/patent/US20180322048A1

## CPC

- G06F 12/0261: {using reference counting}
- G06F 11/34: Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation {; Recording or statistical evaluation of user activity, e.g. usability assessment}
- G06F 12/023: {Free address space management}
- G06F 12/0253: {Garbage collection, i.e. reclamation of unreferenced memory}
- G06F 2212/1044: Space efficiency improvement
- G06F 2212/154: Networked environment
- G06F 2212/163: Server or database system
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A computer-implemented method and computer processing system are provided for coordinated heap contraction. The method includes starting a contraction of a heap responsive to a physical memory use of the heap approaching a limit. The contraction starts from a particular runtime system that was estimated to be slowest for the contraction from among a plurality of runtime systems that use the heap, based on previously determined estimates. The method also includes decreasing the physical memory use of the heap by compacting the heap with only one Garbage Collection (GC) thread, responsive to the contraction of the heap being unable to catch up to the physical memory use.

## Claims

### Claim 1

A computer program product for coordinated heap management, the computer program product comprising a non-transitory computer readable storage medium having program instructions embodied therewith, the program instructions executable by a computer to cause the computer to perform a method comprising:
starting a contraction of a heap responsive to a physical memory use of the heap approaching a limit, the contraction starting from a particular runtime system that was estimated to be slowest for the contraction from among a plurality of runtime systems that use the heap, based on previously determined estimates; and
decreasing the physical memory use of the heap by compacting the heap with only one Garbage Collection (GC) thread, responsive to the contraction of the heap being unable to catch up to the physical memory use.

### Claim 2 (depends on 1)

The computer program product of claim 1, wherein the previously determined estimates are determined by estimating respective time periods spanned to shrink the heap, wherein each of the respective time periods corresponds to a respective one of a plurality of threads.

### Claim 3 (depends on 1)

The computer program product of claim 1, wherein the previously determined estimates are determined by estimating respective time periods spanned to shrink the heap, wherein each of the respective time periods corresponds to a respective one of the plurality of runtime systems.

### Claim 4 (depends on 1)

The computer program product of claim 1, wherein the previously determined estimates are determined as a product of multiplying an amount of remaining memory to reduce by a difficulty of reducing the remaining memory and by a frequency of a GC process.

### Claim 5 (depends on 4)

The computer program product of claim 4, wherein the amount of remaining memory to reduce is determined as a difference of subtracting a current total amount of memory reduction from a dynamic heap adjustment value.

### Claim 6 (depends on 4)

The computer program product of claim 4, wherein the difficulty of reducing the remaining memory is determined from an occupancy rate of objects in a target space in the heap.

### Claim 7 (depends on 4)

The computer program product of claim 4, wherein the frequency of the GC process is determined based on a fragmentation rate in a target space in the heap.

### Claim 8 (depends on 1)

The computer program product of claim 1, wherein the previously determined estimates are determined under a condition that the physical memory use of the heap is not approaching the limit.

### Claim 9 (depends on 1)

The computer program product of claim 1, wherein the plurality of runtime systems are implemented in a cloud environment.

### Claim 10

A computer processing system for coordinated heap contraction, the system comprising:
a processor configured to:
start a contraction of a heap responsive to a physical memory use of the heap approaching a limit, the contraction starting from a particular runtime system that was estimated to be slowest for the contraction from among a plurality of runtime systems that use the heap, based on previously determined estimates; and
decrease the physical memory use of the heap by compacting the heap with only one Garbage Collection (GC) thread, responsive to the contraction of the heap being unable to catch up to the physical memory use.

### Claim 11 (depends on 10)

The computer processing system of claim 10, wherein the computer processing system is implemented in a cloud environment.
