# US 2008/0307183 A1 · Automatic memory management (amm)

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

- Number: US 2008/0307183 A1
- Document ID: US20080307183A1
- Status: Published application
- Kind: A1
- Application number: 11/761,026
- Filed: 2007-06-11
- Published: 2008-12-11
- Earliest claimed: 2007-06-11
- Assignees: International Business Machines Corporation
- Inventors: Gary J. DeVal; Curtis E. Hrischuk
- Web page: https://patentgrep.com/patent/US20080307183A1

## CPC

- G06F 12/0269: {Incremental or concurrent garbage collection, e.g. in real-time systems (G06F12/0261 takes precedence)}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

The present invention manages the execution of multiple AMM cycles to reduce or eliminate any overlap. Specifically, the present invention provides an external supervisory process to monitor the AMM behavior of VMs on one or more nodes, and intervene when coincident AMM activity appears to be imminent. If AMM patterns suggest that two VMs are likely to perform a (e.g., a major) AMM cycle simultaneously (or with significant overlap) in the near future, the supervisory process can trigger one of the VMs to AMM immediately, or at the first ‘safe’ interval prior to the predicted AMM collision. This will have the effect of desynchronizing the AMM behavior of the VMs and maintaining AMM latency for both VMs within the expected bounds for their independent operation, without any inter-VM effects.

## Claims

### Claim 1

A method for Automatic Memory Management (AMM) coordination, comprising:
predicting when a first AMM cycle on a node and a second AMM cycle on the node will occur;
determining whether an overlap of the first AMM cycle with the second AMM cycle will occur; and
rescheduling at least one of the first AMM cycle and the second AMM cycle if the overlap will occur.

### Claim 2 (depends on 1)

The method of claim 1, the first AMM cycle being implemented by a first Virtual Machine (VM) on the node and the second AMM cycle being implemented by second VM on the node.

### Claim 3 (depends on 1)

The method of claim 1, further comprising utilizing historical data for at least one of the predicting and the determining.

### Claim 4 (depends on 3)

The method of claim 3, the historical data comprising next AMM cycle times that specify when the first AMM cycle and the second AMM cycle will commence.

### Claim 5 (depends on 4)

The method of claim 4, the historical data further comprising at least one AMM duration time that specifies a duration of the first AMM cycle and a duration of the second AMM cycle, the determining further comprising using the next AMM cycle times and the at least one AMM duration time to determine whether the overlap will occur.

### Claim 6 (depends on 5)

The method of claim 5, the rescheduling being based on a AMM guard time that specifies a desired delay between termination of the first AMM cycle and commencement of the second AMM cycle.

### Claim 7 (depends on 1)

The method of claim 1, the method being implemented by a system that is external to the node.

### Claim 8

A system for Automatic Memory Management (AMM) coordination, comprising:
a module for predicting when a first virtual machine on a node will enter a first AMM cycle and a second virtual machine on the node will enter a second AMM cycle;
a module for determining whether an overlap of the first AMM cycle with the second AMM cycle will occur; and
a module for rescheduling at least one of the first AMM cycle and the second AMM cycle if the overlap will occur.

### Claim 9 (depends on 8)

The system of claim 8, the first virtual machine and the second virtual machine both being Virtual Machines (VMs).

### Claim 10 (depends on 8)

The system of claim 8, the system utilizing historical data.

### Claim 11 (depends on 8)

The system of claim 8, the historical data comprising next AMM cycle times that specify when the first AMM cycle and the second AMM cycle will commence.

### Claim 12 (depends on 11)

The system of claim 11, the historical data further comprising at least one AMM duration time that specifies a duration of the first AMM cycle and a duration of the second AMM cycle, the module for determining using the next AMM cycle times and the at least one AMM duration time to determine whether the overlap will occur.

### Claim 13 (depends on 12)

The system of claim 12, the module for rescheduling utilizing a AMM guard time that specifies a desired delay between the first AMM cycle and the second AMM cycle to reschedule the at least one of the first AMM cycle and the second AMM cycle, the module for rescheduling being configured to reschedule the at least one of the first AMM cycle and the second AMM cycle if the first AMM cycle is predicted to terminate less than the AMM guard time before the second AMM cycle is predicted to commence.

### Claim 14 (depends on 8)

The system of claim 8, the system being implemented external to the node.

### Claim 15

A program product stored on a computer readable medium for Automatic Memory Management (AMM) coordination, the computer readable medium comprising program code for causing a computer system to:
predict when a first virtual machine on a node will enter a first AMM cycle and a second virtual machine on the node will enter a second AMM cycle;
determine whether an overlap of the first AMM cycle with the second AMM cycle will occur; and
reschedule at least one of the first AMM cycle and the second AMM cycle if the overlap will occur.

### Claim 16 (depends on 15)

The program product of claim 15, the first virtual machine and the second virtual machine both being Java Virtual Machines (VMs).

### Claim 17 (depends on 15)

The program product of claim 15, the computer readable medium further comprising program code for causing the computer system to obtain and utilize historical data.

### Claim 18 (depends on 15)

The program product of claim 15, the historical data comprising next AMM cycle times that specify when the first AMM cycle and the second AMM cycle will commence.

### Claim 19 (depends on 11)

The program product of claim 11, the historical data further comprising at least one AMM duration time that specifies a duration of the first AMM cycle and a duration of the second AMM cycle, the computer readable medium further comprising program code for causing the computer system to use the next AMM cycle times and the at least one AMM duration time to determine whether the overlap will occur.

### Claim 20 (depends on 19)

The program product of claim 19, the computer readable medium further comprising program code for causing the computer system to utilize a AMM guard time that specifies a desired delay between the first AMM cycle and the second AMM cycle to reschedule the at least one of the first AMM cycle and the second AMM cycle, the computer readable medium further comprising program code for causing the computer system to reschedule the at least one of the first AMM cycle and the second AMM cycle if the first AMM cycle is predicted to terminate less than the AMM guard time before the second AMM cycle is predicted to commence.

### Claim 21 (depends on 15)

The program product of claim 15, the program product being implemented external to the node.

### Claim 22

A method for deploying a module for Automatic Memory Management (AMM) coordination, comprising:
providing a computer infrastructure being operable to:
predict when a first virtual machine on a node will enter a first AMM cycle and a second virtual machine on the node will enter a second AMM cycle;
determine whether an overlap of the first AMM cycle with the second AMM cycle will occur; and
reschedule at least one of the first AMM cycle and the second AMM cycle if the overlap will occur.
