International Business Machines Corporation

Globalfoundries Inc.

Ibm Canada Limited - Ibm Canada Limitee

Graeme Johnson

Michael H Dawson

Seetharami R Seelam

Yuqing Gao

Megumi Ito

Xavier Rene Guerin

Charles Robert Gracie

Li Feng Zhang

Parijat Dube

Michel H T Hack

Andrew Russell Low

Trent Gray-Donald

San Hong Li

Arun Kwangil Iyengar

Wei Tan

Liana Liyow Fong

Xiaoqiao Meng

Graham Alan Chapman

Yanbin Liu

John Duimovich

Pramod B Nagaraja

Nai K Ling

Marcel Mitran

Kiyokuni Kawachiya

Akira Koseki

Kevin Alexander Stoodley

Tamiya Onodera

Peter Wiebe Burka

Ali Ijaz Sheikh

Peter Duncan Shipton

Patrick James Mueller

Liana L Fo

Francis Bogsanyl

Julian Z L Wang

Marcio Q Marchini

Ryan Andrew Sciampancone

An illustrative embodiment of a computer-implemented method for working set adjustment receives a request to use less heap memory than an original maximum forming a new maximum, and determines whether a garbage collection will move objects in response to the request. Responsive to a determination the garbage collection will move objects, add a first callback triggered by initiation of the garbage collection and invoking a handler for the first callback notifying a memory manager to free objects allocated by balloon. The first callback completes and the garbage collection starts. A handler for a second callback is invoked which notifies the memory manager to allocate balloon objects and frees backing memory to an operating system, the balloon objects consuming an amount of memory space equal to a remaining portion of memory necessary to return to the operating system. Completion of the second call back allows the garbage collection to proceed as usual.

Working set adjustment in a managed environment

An illustrative embodiment of a computer-implemented method for working set adjustment receives a request to use less heap memory than an original maximum forming a new maximum, and determines whether a garbage collection will move objects in response to the request. Responsive to a determination the garbage collection will move objects, add a first callback triggered by initiation of the garbage collection and invoking a handler for the first callback notifying a memory manager to free objects allocated by balloon. The first callback completes and the garbage collection starts. A handler for a second callback is invoked which notifies the memory manager to allocate balloon objects and frees backing memory to an operating system. Completion of the second call back allows the garbage collection to proceed as usual.

Embodiments of the present invention disclose an approach for inserting code into a running thread of execution. A computer sets a first set of bits to a first value, wherein the first value indicates that a first set of instructions should be inserted onto a stack. The computer executes a second set of instructions associated with a first safepoint, wherein the second set of instructions comprises one or more instructions to determine if the first set of bits is set to the first value. The computer determines that the first set of bits is set to the first value, and the computer inserts the first set of instructions onto the stack.

Dynamic code injection

In a computing system including an application executing on top of a virtualization control layer, wherein the virtualization control layer maps portions of a virtual memory to portions of a physical memory, a method for managing memory including: identifying, by the application, a range of virtual memory whose probability of being replicated in the virtual memory exceeds a given threshold; obtaining, by the application, at least one memory address corresponding to the range of virtual memory; and passing, from the application to the virtualization control layer, an identifier for the range of virtual memory and the memory address corresponding to the range of virtual memory, wherein the identifier is useable by the virtualization control layer to identify similar ranges within the virtual memory.

Application-directed memory de-duplication

In a computing system including an application executing on top of a virtualization control layer, wherein the virtualization control layer maps portions of a virtual memory to portions of a physical memory, an apparatus for managing memory configured to: identify, by the application, a range of virtual memory whose probability of being replicated in the virtual memory exceeds a given threshold; obtain, by the application, at least one memory address corresponding to the range of virtual memory; and pass, from the application to the virtualization control layer, an identifier for the range of virtual memory and the memory address corresponding to the range of virtual memory, wherein the identifier is useable by the virtualization control layer to identify similar ranges within the virtual memory.

A server and/or a client stores a metadata hash map that includes one or more entries associated with keys for data records stored in a cache on a server, wherein the data records comprise Java Virtual Machine (JVM) artifacts or monitoring information. Each of the entries stores metadata for a corresponding data record, wherein the metadata comprises a server-side remote pointer that references the corresponding data record stored in the cache, as well as a version identifier for the key. A selected data record is accessed using a provided key by: (1) identifying potentially matching entries in the metadata hash map using the provided key; (2) accessing data records stored in the cache using the server-side remote pointers from the potentially matching entries; and (3) determining whether the accessed data records match the selected data record using the provided key and the version identifiers from the potentially matching entries.

High performance, distributed, shared, data grid for distributed Java virtual machine runtime artifacts

An unused free memory shortage relative to an adjusted heap maximum size associated with a memory heap of application memory is detected. The adjusted heap maximum size is set to a heap size smaller than a maximum heap allocation size. An increase to the adjusted heap maximum size that resolves the unused free memory shortage is calculated. The adjusted heap maximum size is increased by the calculated increase to the adjusted heap maximum size.

Out-of-memory avoidance in dynamic virtual machine memory adjustment

Out-of memory avoidance in dynamic virtual machine memory adjustment

Methods and arrangements for dynamic memory management. Data are accepted for thread local storage, and memory usage is monitored in thread local storage. A memory block is allocated to thread local storage for storing accepted data, based on the monitored memory usage.

Dynamic memory management with thread local storage usage

Managing buffers in a hybrid system, in one aspect, may comprise selecting a first buffer management method from a plurality of buffer management methods; capturing statistics associated with access to the buffer in the hybrid system running under the initial buffer management method; analyzing the captured statistics; identifying a second buffer management method based on the analyzed captured statistics; determining whether the second buffer management method is more optimal than the first buffer management method; in response to determining that the second buffer management method is more optimal than the first buffer management method, invoking the second buffer management method; and repeating the capturing, the analyzing, the identifying and the determining.

Optimization of native buffer accesses in Java applications on hybrid systems

An initial request for a reference to a data container is sent to a distributed enhanced virtual machine native interface component of a distributed virtual machine in response to receiving an initial request from a remote execution container for the reference to the data container at a distributed enhanced remote execution container native interface component of the distributed virtual machine. A data mirror data structure including immutable data and the reference to the data container received from the distributed enhanced virtual machine native interface component is stored within a local memory storage area. A reference to the locally-stored data mirror data structure is returned to the remote execution container in response to the initial request for the reference to the data container.

Automated caching and mirroring of immutable data in distributed virtual machines via native interface components

An initial request for a reference to a data container is sent to a distributed enhanced virtual machine native interface component of a distributed virtual machine in response to receiving, from a remote execution container, the initial request for the reference to the data container at a distributed enhanced remote execution container native interface component of the distributed virtual machine. A data mirror data structure including immutable data and the reference to the data container is received. The received data mirror data structure including the immutable data and the reference to the data container is stored within a local memory storage area. A reference to the locally-stored data mirror data structure is returned to the remote execution container in response to the initial request for the reference to the data container.

Growing community of inventors

Ottawa, Canada

Graeme Johnson